oj.uz

답안 #733517

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
733517 2023-05-01T01:32:03 Z Trunkty 경찰관과 강도 (BOI14_coprobber) C++14
100 / 100
 418 ms 10292 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int ll

#include "coprobber.h"

bool isgood[505][505][2]; // 0 - robber, 1 - cop
int cnt[505][505],pre[505][505];
vector<tuple<int,int,int>> v;

int start(int n, bool arr[MAX_N][MAX_N]){
    for(int i=0;i<n;i++){
        isgood[i][i][0] = true;
        isgood[i][i][1] = true;
        v.push_back(make_tuple(i,i,0));
        v.push_back(make_tuple(i,i,1));
        for(int j=0;j<n;j++){
            if(arr[i][j]){
                cnt[i][0]++;
            }
        }
        for(int j=1;j<n;j++){
            cnt[i][j] = cnt[i][j-1];
        }
    }
    for(int i=0;i<v.size();i++){
        int a = get<0>(v[i]), b = get<1>(v[i]), c = get<2>(v[i]);
        if(c==0){
            for(int j=0;j<n;j++){
                if(arr[b][j]){
                    if(!isgood[a][j][1]){
                        pre[a][j] = b;
                        isgood[a][j][1] = true;
                        v.push_back(make_tuple(a,j,1));
                    }
                }
            }
            if(!isgood[a][b][1]){
                pre[a][b] = b;
                isgood[a][b][1] = true;
                v.push_back(make_tuple(a,b,1));
            }
        }
        else{
            for(int j=0;j<n;j++){
                if(arr[a][j]){
                    if(!isgood[j][b][0]){
                        cnt[j][b]--;
                        if(cnt[j][b]==0){
                            isgood[j][b][0] = true;
                            v.push_back(make_tuple(j,b,0));
                        }
                    }
                }
            }
        }
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(!isgood[i][j][0] or !isgood[i][j][1]){
                return -1;
            }
        }
    }
    return 1;
}

int curr=1;

int nextMove(int r){
    int a = pre[r][curr];
    curr = a;
    return a;
}

Compilation message

coprobber.cpp: In function 'int start(int, bool (*)[500])':
coprobber.cpp:27:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(int i=0;i<v.size();i++){
      |                 ~^~~~~~~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 196 ms 10264 KB Output is correct
5 Correct 28 ms 3636 KB Output is correct
6 Correct 192 ms 10208 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 187 ms 10212 KB Output is correct
4 Correct 195 ms 10164 KB Output is correct
5 Correct 178 ms 10152 KB Output is correct
6 Correct 232 ms 10164 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 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 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 848 KB Output is correct
11 Correct 2 ms 976 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Correct 2 ms 720 KB Output is correct
14 Correct 3 ms 976 KB Output is correct
15 Correct 1 ms 848 KB Output is correct
16 Correct 2 ms 820 KB Output is correct
17 Correct 6 ms 1552 KB Output is correct
18 Correct 1 ms 848 KB Output is correct
19 Correct 0 ms 336 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 196 ms 10264 KB Output is correct
5 Correct 28 ms 3636 KB Output is correct
6 Correct 192 ms 10208 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 187 ms 10212 KB Output is correct
10 Correct 195 ms 10164 KB Output is correct
11 Correct 178 ms 10152 KB Output is correct
12 Correct 232 ms 10164 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 1 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 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 848 KB Output is correct
23 Correct 2 ms 976 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 2 ms 720 KB Output is correct
26 Correct 3 ms 976 KB Output is correct
27 Correct 1 ms 848 KB Output is correct
28 Correct 2 ms 820 KB Output is correct
29 Correct 6 ms 1552 KB Output is correct
30 Correct 1 ms 848 KB Output is correct
31 Correct 0 ms 336 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 0 ms 336 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 187 ms 10176 KB Output is correct
36 Correct 31 ms 3736 KB Output is correct
37 Correct 211 ms 10188 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 0 ms 336 KB Output is correct
40 Correct 188 ms 10140 KB Output is correct
41 Correct 192 ms 10260 KB Output is correct
42 Correct 170 ms 10056 KB Output is correct
43 Correct 227 ms 10240 KB Output is correct
44 Correct 1 ms 336 KB Output is correct
45 Correct 1 ms 336 KB Output is correct
46 Correct 0 ms 336 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 2 ms 792 KB Output is correct
49 Correct 3 ms 976 KB Output is correct
50 Correct 1 ms 464 KB Output is correct
51 Correct 1 ms 720 KB Output is correct
52 Correct 3 ms 976 KB Output is correct
53 Correct 2 ms 848 KB Output is correct
54 Correct 2 ms 720 KB Output is correct
55 Correct 6 ms 1552 KB Output is correct
56 Correct 1 ms 848 KB Output is correct
57 Correct 5 ms 1360 KB Output is correct
58 Correct 17 ms 2512 KB Output is correct
59 Correct 23 ms 3184 KB Output is correct
60 Correct 418 ms 10260 KB Output is correct
61 Correct 67 ms 4168 KB Output is correct
62 Correct 68 ms 4552 KB Output is correct
63 Correct 361 ms 10276 KB Output is correct
64 Correct 77 ms 4672 KB Output is correct
65 Correct 418 ms 10148 KB Output is correct
66 Correct 202 ms 10048 KB Output is correct
67 Correct 386 ms 10292 KB Output is correct
68 Correct 190 ms 6216 KB Output is correct
69 Correct 1 ms 336 KB Output is correct