oj.uz

답안 #71364

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
71364 2018-08-24T12:20:55 Z someone_aa 경찰관과 강도 (BOI14_coprobber) C++17
100 / 100
 744 ms 8316 KB 
#include "coprobber.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 510;
bool visited[maxn][maxn][2];
bool a[maxn][maxn];
int n;

int lf[maxn][maxn][2];
int nxt[maxn][maxn];

struct state {
    int c, r, t;
};

int curr;

int start(int N, bool A[MAX_N][MAX_N]) {
    queue<state>q;
    for(int c=0;c<N;c++) {
        for(int r=0;r<N;r++) {
            if(c!=r) {
                lf[c][r][0] = 1;
                lf[c][r][1] = count(A[r], A[r]+N, true);
            }
        }
        q.push({c,c,0});
        q.push({c,c,1});
    }

    int calls = 0;
    while(!q.empty()) {
        state curr = q.front();
        q.pop();

        //if(curr.c == 0)
          //  cout<<curr.c<<" "<<curr.r<<" Last was: "<<curr.t<<" -> \n";

        visited[curr.c][curr.r][curr.t] = true;
        calls++;
        if(curr.t) {
            for(int i=0;i<N;i++) {
                if((i==curr.c || A[curr.c][i]) && lf[i][curr.r][0]) {
                    //if(curr.c == 0)
                      //  cout<<"calling: "<<i<<"with state 0"<<"\n";
                    lf[i][curr.r][0] = 0;
                    q.push({i, curr.r, 0});
                    nxt[i][curr.r] = curr.c;
                }
            }
        }
        else {
            for(int i=0;i<N;i++) {
                if(A[curr.r][i] && lf[curr.c][i][1]) {
                    //if(curr.c == 0)
                      //  cout<<"calling: "<<i<<"with state 1"<<" left: "<<lf[curr.c][i][1]<<"\n";
                    lf[curr.c][i][1]--;
                    if(lf[curr.c][i][1] == 0) {
                        q.push({curr.c,i,1});
                    }
                }
            }
        }
    }
    if(calls == 2 * N * N) return 0;
    else return -1;
}

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

Subtask #1
16.0 / 16.0

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

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 305 ms 5348 KB Output is correct
4 Correct 308 ms 5368 KB Output is correct
5 Correct 346 ms 5200 KB Output is correct
6 Correct 314 ms 5240 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 300 ms 5368 KB Output is correct
5 Correct 45 ms 2816 KB Output is correct
6 Correct 336 ms 5624 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 311 ms 5176 KB Output is correct
10 Correct 308 ms 5240 KB Output is correct
11 Correct 294 ms 5240 KB Output is correct
12 Correct 332 ms 5188 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 4 ms 1152 KB Output is correct
18 Correct 5 ms 1152 KB Output is correct
19 Correct 2 ms 640 KB Output is correct
20 Correct 3 ms 896 KB Output is correct
21 Correct 5 ms 1152 KB Output is correct
22 Correct 3 ms 868 KB Output is correct
23 Correct 3 ms 896 KB Output is correct
24 Correct 10 ms 1408 KB Output is correct
25 Correct 4 ms 1152 KB Output is correct
26 Correct 11 ms 1792 KB Output is correct
27 Correct 52 ms 3348 KB Output is correct
28 Correct 94 ms 4060 KB Output is correct
29 Correct 488 ms 8316 KB Output is correct
30 Correct 142 ms 4728 KB Output is correct
31 Correct 135 ms 4984 KB Output is correct
32 Correct 557 ms 7148 KB Output is correct
33 Correct 143 ms 4704 KB Output is correct
34 Correct 744 ms 8132 KB Output is correct
35 Correct 346 ms 5792 KB Output is correct
36 Correct 698 ms 7056 KB Output is correct
37 Correct 287 ms 4556 KB Output is correct
38 Correct 2 ms 384 KB Output is correct