oj.uz

Submission #256956

# Submission time Handle Problem Language Result Execution time Memory
256956 2020-08-03T12:59:08 Z MKopchev Cop and Robber (BOI14_coprobber) C++14
100 / 100
 505 ms 4600 KB 
#include "coprobber.h"
#include<bits/stdc++.h>
using namespace std;

const int nmax=500;

void force_win(int c,int r);
void force_loss(int c,int r);

int in[nmax][nmax];

int parent[nmax][nmax];

bool is_won[nmax][nmax],is_lost[nmax][nmax];

int n;

bool mem[nmax][nmax];

void force_win(int c,int r)
{
    if(is_won[c][r])return;
    is_won[c][r]=1;

    //cout<<"\tforce_win "<<c<<" "<<r<<endl;

    for(int r_prv=0;r_prv<n;r_prv++)
        if(mem[r][r_prv])
    {
        in[c][r_prv]--;

        if(in[c][r_prv]==0)force_loss(c,r_prv);
    }
}

void force_loss(int c,int r)
{
    if(is_lost[c][r])return;
    is_lost[c][r]=1;

    if(is_won[c][r]==0)
    {
        is_won[c][r]=1;
        parent[c][r]=c;
        force_win(c,r);
    }
    //cout<<"\t\tforce_loss "<<c<<" "<<r<<endl;

    for(int c_prv=0;c_prv<n;c_prv++)
        if(mem[c][c_prv]&&is_won[c_prv][r]==0)
        {
            //cout<<"parent "<<c_prv<<" "<<r<<" is "<<c<<endl;

            parent[c_prv][r]=c;

            force_win(c_prv,r);
        }
}

int adj[nmax];

int me;

int start(int N, bool A[nmax][nmax])
{
    memset(parent,-1,sizeof(parent));

    for(int i=0;i<N;i++)
        for(int j=0;j<N;j++)
            mem[i][j]=A[i][j];

    n=N;
    for(int i=0;i<N;i++)
        for(int j=0;j<N;j++)
            if(A[i][j]==1)adj[i]++;

    for(int c=0;c<n;c++)
        for(int r=0;r<n;r++)
            in[c][r]=adj[r];

    for(int i=0;i<N;i++)
        force_win(i,i);

    for(int i=0;i<N;i++)
        force_loss(i,i);

    for(int c=0;c<N;c++)
    {
        bool win=1;

        for(int r=0;r<N;r++)
            if(is_won[c][r]==0)win=0;

        if(win)
        {
            me=c;
            return c;
        }
    }
    return -1;
}
int nextMove(int r)
{
    me=parent[me][r];
    return me;
}
/*
bool A[nmax][nmax];
int main()
{
    int N,M;

    cin>>N>>M;

    for(int i=1;i<=M;i++)
    {
        int u,v;
        cin>>u>>v;
        A[u][v]=1;
        A[v][u]=1;
    }
    cout<<start(N,A)<<endl;

    cout<<nextMove(2)<<endl;
    cout<<nextMove(3)<<endl;
    return 0;
}
*/

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 1 ms 1408 KB Output is correct
4 Correct 176 ms 4472 KB Output is correct
5 Correct 29 ms 2688 KB Output is correct
6 Correct 189 ms 4344 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 1 ms 1408 KB Output is correct
3 Correct 175 ms 4380 KB Output is correct
4 Correct 173 ms 4600 KB Output is correct
5 Correct 165 ms 4344 KB Output is correct
6 Correct 186 ms 4344 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 1 ms 1408 KB Output is correct
4 Correct 1 ms 1280 KB Output is correct
5 Correct 1 ms 1408 KB Output is correct
6 Correct 1 ms 1280 KB Output is correct
7 Correct 1 ms 1316 KB Output is correct
8 Correct 1 ms 1408 KB Output is correct
9 Correct 1 ms 1408 KB Output is correct
10 Correct 3 ms 1664 KB Output is correct
11 Correct 4 ms 1664 KB Output is correct
12 Correct 1 ms 1408 KB Output is correct
13 Correct 2 ms 1536 KB Output is correct
14 Correct 4 ms 1664 KB Output is correct
15 Correct 2 ms 1664 KB Output is correct
16 Correct 2 ms 1664 KB Output is correct
17 Correct 8 ms 1920 KB Output is correct
18 Correct 3 ms 1664 KB Output is correct
19 Correct 1 ms 1280 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 1 ms 1408 KB Output is correct
4 Correct 176 ms 4472 KB Output is correct
5 Correct 29 ms 2688 KB Output is correct
6 Correct 189 ms 4344 KB Output is correct
7 Correct 1 ms 1280 KB Output is correct
8 Correct 1 ms 1408 KB Output is correct
9 Correct 175 ms 4380 KB Output is correct
10 Correct 173 ms 4600 KB Output is correct
11 Correct 165 ms 4344 KB Output is correct
12 Correct 186 ms 4344 KB Output is correct
13 Correct 1 ms 1280 KB Output is correct
14 Correct 1 ms 1280 KB Output is correct
15 Correct 1 ms 1408 KB Output is correct
16 Correct 1 ms 1280 KB Output is correct
17 Correct 1 ms 1408 KB Output is correct
18 Correct 1 ms 1280 KB Output is correct
19 Correct 1 ms 1316 KB Output is correct
20 Correct 1 ms 1408 KB Output is correct
21 Correct 1 ms 1408 KB Output is correct
22 Correct 3 ms 1664 KB Output is correct
23 Correct 4 ms 1664 KB Output is correct
24 Correct 1 ms 1408 KB Output is correct
25 Correct 2 ms 1536 KB Output is correct
26 Correct 4 ms 1664 KB Output is correct
27 Correct 2 ms 1664 KB Output is correct
28 Correct 2 ms 1664 KB Output is correct
29 Correct 8 ms 1920 KB Output is correct
30 Correct 3 ms 1664 KB Output is correct
31 Correct 1 ms 1280 KB Output is correct
32 Correct 1 ms 1280 KB Output is correct
33 Correct 1 ms 1280 KB Output is correct
34 Correct 1 ms 1408 KB Output is correct
35 Correct 181 ms 4600 KB Output is correct
36 Correct 33 ms 2804 KB Output is correct
37 Correct 179 ms 4344 KB Output is correct
38 Correct 1 ms 1280 KB Output is correct
39 Correct 1 ms 1408 KB Output is correct
40 Correct 168 ms 4472 KB Output is correct
41 Correct 176 ms 4472 KB Output is correct
42 Correct 178 ms 4364 KB Output is correct
43 Correct 183 ms 4344 KB Output is correct
44 Correct 1 ms 1280 KB Output is correct
45 Correct 1 ms 1280 KB Output is correct
46 Correct 1 ms 1408 KB Output is correct
47 Correct 1 ms 1408 KB Output is correct
48 Correct 2 ms 1664 KB Output is correct
49 Correct 4 ms 1664 KB Output is correct
50 Correct 1 ms 1408 KB Output is correct
51 Correct 2 ms 1664 KB Output is correct
52 Correct 4 ms 1664 KB Output is correct
53 Correct 2 ms 1664 KB Output is correct
54 Correct 2 ms 1664 KB Output is correct
55 Correct 8 ms 1920 KB Output is correct
56 Correct 2 ms 1664 KB Output is correct
57 Correct 6 ms 2048 KB Output is correct
58 Correct 20 ms 2944 KB Output is correct
59 Correct 33 ms 3192 KB Output is correct
60 Correct 213 ms 4344 KB Output is correct
61 Correct 133 ms 3192 KB Output is correct
62 Correct 135 ms 3192 KB Output is correct
63 Correct 332 ms 4472 KB Output is correct
64 Correct 53 ms 3320 KB Output is correct
65 Correct 505 ms 4472 KB Output is correct
66 Correct 176 ms 4216 KB Output is correct
67 Correct 344 ms 4356 KB Output is correct
68 Correct 201 ms 3320 KB Output is correct
69 Correct 1 ms 1280 KB Output is correct