SPOJ AMR12B 720

这个题应该是个优先队列的模版题 当时比赛的时候没时间做先贴一下大神的代码好好学习学习

B - Gandalf vs the Balrog

Time Limit:2000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit Status Practice SPOJ AMR12B

Description

 

'We fought far under the living earth, where time is not counted. Ever he clutched me, and ever I hewed him, till at last he fled into dark tunnels. Ever up now we went, until we came to the Endless Stair. Out he sprang, and even as I came behind, he burst into new flame. Those that looked up from afar thought that the mountain was crowned with storm. Thunder they heard, and lightning, they said, smote upon Celebdil, and leaped back broken into tongues of fire.' - Gandalf, describing his fight against the Balrog.

Although Gandalf would not go into the details of his battle, they can be summarized into the following simplified form: both Gandalf and the Balrog have a set of N attacks they can use (spells, swords, brute-force strength etc.). These attacks are numbered from 1 to N in increasing order of Power. When each has chosen an attack, in general, the one with the higher power wins. However, there are a few ("M") anomalous pairs of attacks, in which the lesser-powered attack wins.

Initially, Gandalf picks an attack. Then the Balrog counters it with one of the remaining attacks. If the Balrog's counter does not defeat Gandalf's, then we say Gandalf receives a score of 2. If however it does, then Gandalf has exactly one more opportunity to pick an attack that will defeat the Balrog's. If he manages to defeat him now, his score will be 1, whereas if he is still unable to defeat him, his score will be 0.

Your task is to determine, given N and the M anomalous pairs of attacks, what will be Gandalf's score, given that both play optimally. Further, in case Gandalf gets a score of 2, you must also determine which attack he could have chosen as his first choice.

Note 1: The Balrog can choose only one attack, whereas Gandalf can choose upto two.

Note 2: The relation A defeats B is not transitive within the attacks. For example, attack A can defeat attack B, attack B can defeat attack C, and attack C can defeat attack A.

Note 3: Between any two attacks A and B, either attack A defeats attack B or attack B defeats attack A.

Input (STDIN):

The first line will consist of the integer T, the number of test-cases.

Each test case begins with a single line containing two integers N and M.

This is followed by M lines consisting of 2 integers each x and y, denoting that x and y are an anomalous pair.

Output (STDOUT):

For each test-case, output a single line either

2 A, if Gandalf can defeat any attack the Balrog chooses if he picks attack A,

1, if Gandalf can choose an attack such that even if the Balrog chooses an attack to defeat him, he can choose an attack to defeat the Balrog's chosen card,

0, if none of the above two options are possible for all possible choices of Gandalf's attack(s).

Between successive test cases, there should not be any blank lines in the output.

Constraints:

1 <= T <= 15

3 <= N <= 1,000,000

0 <= M <= min(N(N-1)/2, 300,000)

1 <= x < y <= N for all the anomalous pairs (x,y)

The sum of M over all test-cases will not exceed 300,000.

Time Limit: 4s

Memory Limit: 64MB

Sample Input:

2

3 0

3 1

1 3 

Sample Output:

2 3

1

Notes/Explanation of Sample Input:

In the first case, attack 3 can beat both attacks 1 and 2. So Gandalf just chooses attack 3.

In the second case, attack 1 beats 3 which beats 2 which beats 1. No matter which attack Gandalf chooses, the Balrog can pick the one which defeats his, but then he can pick the remaining attack and defeat the Balrog's.

'We fought far under the living earth, where time is not counted. Ever he clutched me, and ever I hewed him, till at last he fled into dark tunnels. Ever up now we went, until we came to the Endless Stair. Out he sprang, and even as I came behind, he burst into new flame. Those that looked up from afar thought that the mountain was crowned with storm. Thunder they heard, and lightning, they said, smote upon Celebdil, and leaped back broken into tongues of fire.' - Gandalf, describing his fight against the Balrog.

 

Although Gandalf would not go into the details of his battle, they can be summarized into the following simplified form: both Gandalf and the Balrog have a set of N attacks they can use (spells, swords, brute-force strength etc.). These attacks are numbered from 1 to N in increasing order of Power. When each has chosen an attack, in general, the one with the higher power wins. However, there are a few ("M") anomalous pairs of attacks, in which the lesser-powered attack wins.

 

Initially, Gandalf picks an attack. Then the Balrog counters it with one of the remaining attacks. If the Balrog's counter does not defeat Gandalf's, then we say Gandalf receives a score of 2. If however it does, then Gandalf has exactly one more opportunity to pick an attack that will defeat the Balrog's. If he manages to defeat him now, his score will be 1, whereas if he is still unable to defeat him, his score will be 0.

 

Your task is to determine, given N and the M anomalous pairs of attacks, what will be Gandalf's score, given that both play optimally. Further, in case Gandalf gets a score of 2, you must also determine which attack he could have chosen as his first choice.

 

Note 1: The Balrog can choose only one attack, whereas Gandalf can choose upto two.

Note 2: The relation A defeats B is not transitive within the attacks. For example, attack A can defeat attack B, attack B can defeat attack C, and attack C can defeat attack A.

Note 3: Between any two attacks A and B, either attack A defeats attack B or attack B defeats attack A.

 

Input (STDIN):

The first line will consist of the integer T, the number of test-cases.

Each test case begins with a single line containing two integers N and M.

This is followed by M lines consisting of 2 integers each x and y, denoting that x and y are an anomalous pair.

 

Output (STDOUT):

For each test-case, output a single line either

2 A, if Gandalf can defeat any attack the Balrog chooses if he picks attack A,

1, if Gandalf can choose an attack such that even if the Balrog chooses an attack to defeat him, he can choose an attack to defeat the Balrog's chosen card,

0, if none of the above two options are possible for all possible choices of Gandalf's attack(s).

Between successive test cases, there should not be any blank lines in the output.

 

Constraints:

1 <= T <= 15

3 <= N <= 1,000,000

0 <= M <= min(N(N-1)/2, 300,000)

1 <= x < y <= N for all the anomalous pairs (x,y)

The sum of M over all test-cases will not exceed 300,000.

 

Sample Input:

2

3 0

3 1

1 3 

 

Sample Output:

2 3

1

 

Notes/Explanation of Sample Input:

In the first case, attack 3 can beat both attacks 1 and 2. So Gandalf just chooses attack 3.

In the second case, attack 1 beats 3 which beats 2 which beats 1. No matter which attack Gandalf chooses, the Balrog can pick the one which defeats his, but then he can pick the remaining attack and defeat the Balrog's.

 

 

#include <iostream>

using namespace std;

int array[1000001];

int main()
{
    int t, n, m, x, y;
    cin >> t;

    while (t--)
    {
        cin >> n >> m;

        for (int i = 1; i <= n; i++)
        {
            array[i] = n - i;
        }

        for (int i = 0; i < m; i++)
        {
            cin >> x >> y;
            array[x]--;
            array[y]++;
        }

        int ok = 0;
        for (int i = 1; i <= n; i++)
        {
            if (array[i] == 0)
            {
                ok = i;
                break;
            }
        }

        if (ok)
        {
            cout << 2 << ' ' << ok << endl;
        }
        else
        {
            cout << 1 << endl;
        }
    }
    return 0;
}

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<string>
#include<iostream>
#include<vector>
#define N 1001000

using namespace std;

int in[N];
int out[N];
int n,m;
int main()
{
    int cas;
    scanf("%d",&cas);
    while (cas--){
        scanf("%d%d",&n,&m);
        memset(in,0,sizeof(in));
        memset(out,0,sizeof(out));

        for (int i=1;i<=m;i++){
            int x,y;
            scanf("%d%d",&x,&y);
            in[y]++;
            out[x]++;
        }
        int i = n;
        while (i>=1 && !(in[i]==0 && out[i]>=(n - i))){
            i--;

        }
        if (i>=1){
            printf("2 %d\n",i);
        }else{
            if (m == (n-1)*n /2)
                printf("0\n");
            else
                printf("1\n");
        }
    }
    return 0;
}

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <cctype>
#include <climits>
#include <ctime>
#include <vector>
#include <set>
#include <stack>
#include <sstream>
#include <iomanip>
#define MAX 1000010
#define CLR(arr,val) memset(arr,val,sizeof(arr))

using namespace std;

int cards[MAX], defeated[MAX];

int main()
{
    std::ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
    freopen( "in.txt", "r", stdin );
    //freopen( "out.txt", "w", stdout );
    clock_t program_start, program_end;
    program_start = clock();
#endif
    int T, N, M, x, y, max_card;
    cin >> T;
    while ( T-- )
    {
        cin >> N >> M;
        for ( int i = 1; i <= N; ++i )
        {
            cards[i] = 0;
            defeated[i] = 0;
        }
        for ( int i = 0; i < M; ++i )
        {
            cin >> x >> y;
            cards[x]++; defeated[y]++;
        }
        max_card = -1;
        for ( int i = N; i >= 1; --i )
            if ( cards[i] == N - i && defeated[i] == 0 )
            {
                max_card = i;
                break;
            }
        if ( max_card != -1 )
            cout << "2 " << max_card << endl;
        else
            cout << "1" << endl;
    }

#ifndef ONLINE_JUDGE
    program_end = clock();
    cerr << "Time consumed: " << endl << ( program_end - program_start ) << " MS" << endl;
#endif
}