oj.uz

Submission #556305

# Submission time Handle Problem Language Result Execution time Memory
556305 2022-05-02T20:31:42 Z new_acc Cop and Robber (BOI14_coprobber) C++14
100 / 100
 772 ms 8076 KB 
#include "coprobber.h"
#include<bits/stdc++.h>
#define fi first
#define se second
#define pitem item*
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=500;
const int SS=1<<19;
const int INFi=2e9;
const ll INFl=1e13;
const ll mod2=998244353;
const ll mod=1e9+7;
const ll mod3=1000696969;
const ll p=70032301;
const ull p2=913;
const int L=20;
struct st{
    int a,b,c;
};
bool dp[N][N][2];
int nxt[N][N],il[N][N],last;
vi graf[N];
int start(int n, bool t[N][N]){
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++)
            if(t[i][j]) graf[i].push_back(j);
    }
    deque<st>deq;
    for(int i=0;i<n;i++){
        deq.push_back({i,i,0}),deq.push_back({i,i,1});
        dp[i][i][0]=1,dp[i][i][1]=1;
    }
    while(deq.size()){
        st v=deq.front();
        deq.pop_front();
        if(v.c){
            for(auto u:graf[v.b]){
                il[u][v.a]++;
                if(il[u][v.a]==graf[u].size()) deq.push_back({u,v.a,0}),dp[u][v.a][0]=1;
            }
        }else{
            for(auto u:graf[v.b])
                if(!dp[u][v.a][1]) deq.push_back({u,v.a,1}),nxt[u][v.a]=v.b,dp[u][v.a][1]=1;
            if(!dp[v.b][v.a][1]) deq.push_back({v.b,v.a,1}),nxt[v.b][v.a]=v.b,dp[v.b][v.a][1]=1;
        }
    }
    for(int i=0;i<n;i++){
        bool ok=1;
        for(int k=0;k<n;k++) ok&=dp[i][k][1];
        if(ok){
            last=i;
            return i;
        }
    }
    return -1;
}

int nextMove(int R){
    int res=nxt[last][R];
    last=res;
    return res;
}

Compilation message

coprobber.cpp: In function 'int start(int, bool (*)[500])':
coprobber.cpp:43:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |                 if(il[u][v.a]==graf[u].size()) deq.push_back({u,v.a,0}),dp[u][v.a][0]=1;
      |                    ~~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 56 ms 4132 KB Output is correct
5 Correct 14 ms 2156 KB Output is correct
6 Correct 60 ms 4344 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 57 ms 4144 KB Output is correct
4 Correct 56 ms 4132 KB Output is correct
5 Correct 56 ms 4084 KB Output is correct
6 Correct 57 ms 4040 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 848 KB Output is correct
11 Correct 3 ms 932 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Correct 1 ms 720 KB Output is correct
14 Correct 2 ms 848 KB Output is correct
15 Correct 1 ms 720 KB Output is correct
16 Correct 1 ms 720 KB Output is correct
17 Correct 6 ms 1104 KB Output is correct
18 Correct 2 ms 848 KB Output is correct
19 Correct 0 ms 336 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 56 ms 4132 KB Output is correct
5 Correct 14 ms 2156 KB Output is correct
6 Correct 60 ms 4344 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 57 ms 4144 KB Output is correct
10 Correct 56 ms 4132 KB Output is correct
11 Correct 56 ms 4084 KB Output is correct
12 Correct 57 ms 4040 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 0 ms 336 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 1 ms 848 KB Output is correct
23 Correct 3 ms 932 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 720 KB Output is correct
26 Correct 2 ms 848 KB Output is correct
27 Correct 1 ms 720 KB Output is correct
28 Correct 1 ms 720 KB Output is correct
29 Correct 6 ms 1104 KB Output is correct
30 Correct 2 ms 848 KB Output is correct
31 Correct 0 ms 336 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 0 ms 336 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 56 ms 4128 KB Output is correct
36 Correct 15 ms 2128 KB Output is correct
37 Correct 59 ms 4328 KB Output is correct
38 Correct 0 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 56 ms 4128 KB Output is correct
41 Correct 55 ms 4232 KB Output is correct
42 Correct 53 ms 4144 KB Output is correct
43 Correct 56 ms 4080 KB Output is correct
44 Correct 0 ms 336 KB Output is correct
45 Correct 0 ms 336 KB Output is correct
46 Correct 0 ms 336 KB Output is correct
47 Correct 0 ms 336 KB Output is correct
48 Correct 2 ms 848 KB Output is correct
49 Correct 3 ms 848 KB Output is correct
50 Correct 1 ms 464 KB Output is correct
51 Correct 1 ms 720 KB Output is correct
52 Correct 2 ms 848 KB Output is correct
53 Correct 1 ms 720 KB Output is correct
54 Correct 1 ms 720 KB Output is correct
55 Correct 6 ms 1176 KB Output is correct
56 Correct 2 ms 848 KB Output is correct
57 Correct 5 ms 1360 KB Output is correct
58 Correct 15 ms 2440 KB Output is correct
59 Correct 25 ms 3004 KB Output is correct
60 Correct 772 ms 8076 KB Output is correct
61 Correct 88 ms 4176 KB Output is correct
62 Correct 74 ms 4332 KB Output is correct
63 Correct 528 ms 6712 KB Output is correct
64 Correct 42 ms 3600 KB Output is correct
65 Correct 569 ms 7860 KB Output is correct
66 Correct 65 ms 4708 KB Output is correct
67 Correct 262 ms 6208 KB Output is correct
68 Correct 82 ms 3576 KB Output is correct
69 Correct 0 ms 336 KB Output is correct