Codeforces Round #244 (Div. 2) A~C

A. Police Recruits

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

The police department of your city has just started its journey. Initially, they don’t have any manpower. So, they started hiring new recruits in groups.

Meanwhile, crimes keeps occurring within the city. One member of the police force can investigate only one crime during his/her lifetime.

If there is no police officer free (isn't busy with crime) during the occurrence of a crime, it will go untreated.

Given the chronological order of crime occurrences and recruit hirings, find the number of crimes which will go untreated.

Input

The first line of input will contain an integer n (1 ≤ n ≤ 105), the number of events. The next line will contain n space-separated integers.

If the integer is -1 then it means a crime has occurred. Otherwise, the integer will be positive, the number of officers recruited together at that time. No more than 10 officers will be recruited at a time.

Output

Print a single integer, the number of crimes which will go untreated.

Sample test(s)

input

3
-1 -1 1

output

2

input

8
1 -1 1 -1 -1 1 1 1

output

1

input

11
-1 -1 2 -1 -1 -1 -1 -1 -1 -1 -1

output

8

Note

Lets consider the second example:

1. Firstly one person is hired.
2. Then crime appears, the last hired person will investigate this crime.
3. One more person is hired.
4. One more crime appears, the last hired person will investigate this crime.
5. Crime appears. There is no free policeman at the time, so this crime will go untreated.
6. One more person is hired.
7. One more person is hired.
8. One more person is hired.

The answer is one, as one crime (on step 5) will go untreated.

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int main()
{
    int n,ans=0,x,sum=0;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%d",&x);
        if(x==-1)
        {
            if(sum>0)
            {
                sum--;
            }
            else ans++;
        }
        else sum+=x;
    }
    printf("%d\n",ans);
    return 0;
}

B. Prison Transfer

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

The prison of your city has n prisoners. As the prison can't accommodate all of them, the city mayor has decided to transfer c of the prisoners to a prison located in another city.

For this reason, he made the n prisoners to stand in a line, with a number written on their chests. The number is the severity of the crime he/she has committed. The greater the number, the more severe his/her crime was.

Then, the mayor told you to choose the c prisoners, who will be transferred to the other prison. He also imposed two conditions. They are,

• The chosen c prisoners has to form a contiguous segment of prisoners.
• Any of the chosen prisoner's crime level should not be greater then t. Because, that will make the prisoner a severe criminal and the mayor doesn't want to take the risk of his running away during the transfer.

Find the number of ways you can choose the c prisoners.

Input

The first line of input will contain three space separated integers n (1 ≤ n ≤ 2·105), t (0 ≤ t ≤ 109) and c (1 ≤ c ≤ n). The next line will contain n space separated integers, the ith integer is the severity ith prisoner's crime. The value of crime severities will be non-negative and will not exceed 109.

Output

Print a single integer — the number of ways you can choose the c prisoners.

Sample test(s)

input

4 3 3
2 3 1 1

output

2

input

1 1 1
2

output

0

input

11 4 2
2 2 0 7 3 2 2 4 9 1 4

output

6

裸的RMQ

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>

using namespace std;

int dp[200200][20],a[200200],m,t,c;

int RMQ_init()
{
    for(int i=1;i<=m;i++) dp[i][0]=a[i];

    for(int j=1;(1<<j)<=m;j++)
    {
        for(int i=1;i+(1<<j)-1<=m;i++)
        {
            dp[i][j]=max(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);
        }
    }
}

int RMQ(int L,int R)
{
    int k;
    //while((1<<(k+1))<=(R-L+1)) k++;
    k=floor(log(R-L+1.0)/log(2.0));
    return max(dp[L][k],dp[R-(1<<k)+1][k]);
}

int main()
{
    scanf("%d%d%d",&m,&t,&c);
    for(int i=1;i<=m;i++)
        scanf("%d",&a[i]);
    RMQ_init();
    ///int x,y;while(cin>>x>>y) cout<<RMQ(x,y)<<endl;
    int ans=0;
    for(int i=1;i<=m;i++)
    {
        int j=i+c-1;
        if(j>m) break;
        if(RMQ(i,j)<=t) ans++;
    }
    printf("%d\n",ans);
    return 0;
}

C. Checkposts

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Your city has n junctions. There are m one-way roads between the junctions. As a mayor of the city, you have to ensure the security of all the junctions.

To ensure the security, you have to build some police checkposts. Checkposts can only be built in a junction. A checkpost at junction ican protect junction j if either i = j or the police patrol car can go to j from i and then come back to i.

Building checkposts costs some money. As some areas of the city are more expensive than others, building checkpost at some junctions might cost more money than other junctions.

You have to determine the minimum possible money needed to ensure the security of all the junctions. Also you have to find the number of ways to ensure the security in minimum price and in addition in minimum number of checkposts. Two ways are different if any of the junctions contains a checkpost in one of them and do not contain in the other.

Input

In the first line, you will be given an integer n, number of junctions (1 ≤ n ≤ 105). In the next line, n space-separated integers will be given. The ith integer is the cost of building checkpost at the ith junction (costs will be non-negative and will not exceed 109).

The next line will contain an integer m (0 ≤ m ≤ 3·105). And each of the next m lines contains two integers ui and vi (1 ≤ ui, vi ≤ n; u ≠ v). A pair ui, vi means, that there is a one-way road which goes from ui to vi. There will not be more than one road between two nodes in the same direction.

Output

Print two integers separated by spaces. The first one is the minimum possible money needed to ensure the security of all the junctions. And the second one is the number of ways you can ensure the security modulo 1000000007 (109 + 7).

Sample test(s)

input

3
1 2 3
3
1 2
2 3
3 2

output

3 1

input

5
2 8 0 6 0
6
1 4
1 3
2 4
3 4
4 5
5 1

output

8 2

input

10
1 3 2 2 1 3 1 4 10 10
12
1 2
2 3
3 1
3 4
4 5
5 6
5 7
6 4
7 3
8 9
9 10
10 9

output

15 6

input

2
7 91
2
1 2
2 1

output

7 1

裸的tarjan缩点

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int maxV=100100,maxE=300300,MOD=1000000007;

struct Edge
{
	int to,next;
}edge[maxE];

int Adj[maxV],Size;

void init()
{
	Size=0;
	memset(Adj,-1,sizeof(Adj));
}

void Add_Edge(int u,int v)
{
	edge[Size].to=v; edge[Size].next=Adj[u]; Adj[u]=Size++;
}

int Low[maxV],DFN[maxV],Stack[maxV],Belong[maxV];
int Index,top,scc,n;

int minvalue[maxV],valu[maxV],mincount[maxV];

bool Instack[maxV]; int num[maxV];

void tarjan(int u)
{
    //cout<<"!!!!!! "<<u<<endl;
	int v;
	Low[u]=DFN[u]=++Index;
	Stack[top++]=u;
	Instack[u]=true;
	for(int i=Adj[u];~i;i=edge[i].next)
	{
		v=edge[i].to;
		if(!DFN[v])
		{
			tarjan(v);
			Low[u]=min(Low[u],Low[v]);
		}
		else if(Instack[v])
		{
			Low[u]=min(Low[u],DFN[v]);
		}
	}

	if(Low[u]==DFN[u])
	{
		scc++;
		do
		{
			v=Stack[--top];
			Instack[v]=false;
			num[scc]++;
			Belong[v]=scc;
			if(minvalue[scc]>valu[v])
            {
                minvalue[scc]=valu[v];
                mincount[scc]=1;
            }
            else if(minvalue[scc]==valu[v]) mincount[scc]++;
		}while(v!=u);
	}
}

void solve(int n)
{
	memset(DFN,0,sizeof(DFN));
	memset(Instack,false,sizeof(Instack));
	memset(num,0,sizeof(num));
	memset(minvalue,63,sizeof(minvalue));
	memset(mincount,0,sizeof(mincount));

	Index=scc=top=0;

	for(int i=1;i<=n;i++)
	{
		if(!DFN[i]) tarjan(i);
	}
}

void Debug()
{
    cout<<"scc: "<<scc<<endl;

    for(int i=1;i<=scc;i++) cout<<num[i]<<"--";
    cout<<endl;

    for(int i=1;i<=n;i++)
    {
        cout<<i<<" DFN: "<<DFN[i]<<" , Low: "<<Low[i]<<"     "<<Belong[i]<<endl;
    }
    cout<<endl;
}

int main()
{
    int m;
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",valu+i);
    init();
    scanf("%d",&m);
    int a,b;
    for(int i=0;i<m;i++)
    {
        scanf("%d%d",&a,&b);
        Add_Edge(a,b);
    }
    solve(n);
   // Debug();
    long long int ans=0,ans2=1;
    for(int i=1;i<=scc;i++)
    {
      //          cout<<"min value: "<<minvalue[i]<<endl;

        ans=ans+minvalue[i];
        ans2=(ans2*mincount[i])%MOD;
    }
    cout<<ans<<" "<<ans2<<endl;
	return 0;
}