oj.uz

답안 #252559

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252559 2020-07-25T20:52:22 Z fivefourthreeone 경찰관과 강도 (BOI14_coprobber) C++17
100 / 100
 699 ms 8056 KB 
#include <bits/stdc++.h>
#define owo(i,a, b) for(int i=(a);i<(b); ++i)
#define uwu(i,a, b) for(int i=(a)-1; i>=(b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout<<"ayaya~"<<endl
 
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
gp_hash_table<int, int> mp;*/
using ll = long long;
using ld = long double;
const ll MOD = 1000000007;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
ll binpow(ll a,ll b){ll res=1;while(b){if(b&1)res=(res*a)%MOD;a=(a*a)%MOD;b>>=1;}return res;}
ll modInv(ll a){return binpow(a, MOD-2);}
const double PI = acos(-1);
const double eps = -1e6;
const int INF = 0x3f3f3f3f;
const int NINF = 0xc0c0c0c0;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const ll NINFLL = 0xc0c0c0c0c0c0c0c0;
const int mxN = 500;
int st = -1;
int adj[mxN][mxN];
int cnt[mxN];
int num[mxN][mxN];
int par[mxN][mxN];
bool state[mxN][mxN][2];
//state = [cop_pos, robber_pos]
//0 is cop's turn
//1 is robber's turn
int n;
int start(int N, bool A[mxN][mxN]) {
    n= N;
    queue<array<int, 3>> Q;
    owo(i, 0, n) {
        owo(j, 0, n) {
            adj[i][j] = A[i][j];
            cnt[i]+=adj[i][j];
        }
        state[i][i][0] = true;
        state[i][i][1] = true;
        Q.push({i, i, 0});
        Q.push({i, i, 1});
    }
    while(!Q.empty()) {
        auto p = Q.front();
        Q.pop();
        if(p[2]==0) {
            owo(i, 0, n) {
                if(adj[p[1]][i]) {
                    if(state[p[0]][i][1])continue;
                    num[p[0]][i]++;
                    if(num[p[0]][i]==cnt[i]) {
                        state[p[0]][i][1] = true;
                        Q.push({p[0], i, 1});
                    }
                }
            }
        }else {
            owo(i, 0, n) {
                if(adj[p[0]][i]||i==p[0]) {
                    if(state[i][p[1]][0])continue;
                    state[i][p[1]][0] = true;
                    par[i][p[1]] = p[0];
                    Q.push({i, p[1], 0});
                }
            }
        }
    }
    owo(i, 0, n) {
        owo(j, 0, n) {
            if(!state[i][j][0])break;
            if(j==n-1)st = i;
        }
    }
    return st;
}
int nextMove(int R) {
    return st = par[st][R];
}
/*int main() {
    int N;
    cin >> N;
    bool A[mxN][mxN];
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            cin >> A[i][j];
        }
    }
    int P = start(N,A);
    int curr = -1;
    while(st!=curr) {
        cout<<"cop: "<<st<<"\n";
        cin>>curr;
        nextMove(curr);
    }
    cout << P << endl;
    int R;
    cin >> R;
    while (true) {
        if (P == R) break;
        P = nextMove(R);
        cout << P << endl;
        if (P == R) break;
        cin >> R;
    }
}*/

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 348 ms 5240 KB Output is correct
5 Correct 51 ms 2680 KB Output is correct
6 Correct 359 ms 5368 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 512 KB Output is correct
3 Correct 339 ms 5352 KB Output is correct
4 Correct 366 ms 5240 KB Output is correct
5 Correct 325 ms 5240 KB Output is correct
6 Correct 366 ms 5240 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 512 KB Output is correct
6 Correct 0 ms 376 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 512 KB Output is correct
10 Correct 2 ms 1024 KB Output is correct
11 Correct 3 ms 1152 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 896 KB Output is correct
14 Correct 4 ms 1024 KB Output is correct
15 Correct 2 ms 768 KB Output is correct
16 Correct 2 ms 768 KB Output is correct
17 Correct 9 ms 1416 KB Output is correct
18 Correct 2 ms 1024 KB Output is correct
19 Correct 1 ms 384 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 348 ms 5240 KB Output is correct
5 Correct 51 ms 2680 KB Output is correct
6 Correct 359 ms 5368 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 512 KB Output is correct
9 Correct 339 ms 5352 KB Output is correct
10 Correct 366 ms 5240 KB Output is correct
11 Correct 325 ms 5240 KB Output is correct
12 Correct 366 ms 5240 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 512 KB Output is correct
18 Correct 0 ms 376 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 512 KB Output is correct
22 Correct 2 ms 1024 KB Output is correct
23 Correct 3 ms 1152 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 1 ms 896 KB Output is correct
26 Correct 4 ms 1024 KB Output is correct
27 Correct 2 ms 768 KB Output is correct
28 Correct 2 ms 768 KB Output is correct
29 Correct 9 ms 1416 KB Output is correct
30 Correct 2 ms 1024 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 358 ms 5156 KB Output is correct
36 Correct 55 ms 2688 KB Output is correct
37 Correct 385 ms 5368 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 512 KB Output is correct
40 Correct 355 ms 5176 KB Output is correct
41 Correct 348 ms 5400 KB Output is correct
42 Correct 354 ms 5016 KB Output is correct
43 Correct 385 ms 5112 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 0 ms 384 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 0 ms 512 KB Output is correct
48 Correct 2 ms 1024 KB Output is correct
49 Correct 3 ms 1152 KB Output is correct
50 Correct 1 ms 504 KB Output is correct
51 Correct 1 ms 896 KB Output is correct
52 Correct 3 ms 1152 KB Output is correct
53 Correct 2 ms 768 KB Output is correct
54 Correct 2 ms 768 KB Output is correct
55 Correct 10 ms 1408 KB Output is correct
56 Correct 2 ms 1024 KB Output is correct
57 Correct 6 ms 1920 KB Output is correct
58 Correct 18 ms 3328 KB Output is correct
59 Correct 28 ms 4096 KB Output is correct
60 Correct 470 ms 8056 KB Output is correct
61 Correct 90 ms 4728 KB Output is correct
62 Correct 87 ms 4856 KB Output is correct
63 Correct 622 ms 7196 KB Output is correct
64 Correct 107 ms 4600 KB Output is correct
65 Correct 699 ms 8000 KB Output is correct
66 Correct 357 ms 5752 KB Output is correct
67 Correct 661 ms 6824 KB Output is correct
68 Correct 248 ms 4344 KB Output is correct
69 Correct 0 ms 384 KB Output is correct