oj.uz

답안 #841917

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
841917 2023-09-02T08:32:31 Z manizare 경찰관과 강도 (BOI14_coprobber) C++14
100 / 100
 326 ms 5860 KB 
#include<bits/stdc++.h>
#include "coprobber.h"
 
using namespace std;
 
#define pb push_back
#define ll long long
#define F first
#define S second
#define all(s) s.begin(),s.end()
const int maxn = 502 ;
bool mark[maxn][maxn][2] , c[500][500] ; 
int nxt[maxn][maxn] , cur = 0 ,ted[maxn][maxn] ;
vector <int> G[maxn]  ;

void dfs(int vi , int vj , int k){
  mark[vi][vj][k] = 1;
  if(k == 1){
    if(mark[vi][vj][0]==0){
      nxt[vi][vj] = vi ;
      dfs(vi , vj , 0) ;
    }
    for(int i =0 ; i < G[vi].size() ; i++){
      int u = G[vi][i] ;
      if(mark[u][vj][0] == 0){
        nxt[u][vj] = vi ;
        dfs(u , vj , 0) ; 
      }
    }
  }else{
    for(int i =0 ; i < G[vj].size() ; i++){
      int u = G[vj][i] ;
      if(mark[vi][u][1] == 0){
        ted[vi][u]--;
        if(ted[vi][u] == 0){
          dfs(vi , u , 1) ;
        }
      }
    }
  }
}

int start(int n , bool a[500][500]){
  for(int i =0 ; i < n ; i++){
    for(int j = 0 ; j < n ; j++){
      if(a[i][j] == 1){
        G[i].pb(j) ;
      }
    }
  }
  for(int i =0 ; i < n ; i++){
    for(int j= 0 ; j < n ; j++){
      ted[i][j] = G[j].size() ;
    }
  }
  for(int i = 0 ; i < n ; i++){
    if(mark[i][i][0] == 0)
    dfs(i , i , 0) ; 
    if(mark[i][i][1] == 0)
    dfs(i , i , 1);
  }
  cur = -1 ;
  for(int i = 0 ; i < n ; i++){
    bool ok =1 ;
    for(int j =0 ; j < n ; j++){
      if(mark[i][j][0] == 0)ok =0  ;
    }
    if(ok == 1){
      cur = i ;
      break ;
    }
  }
  return cur ; 
}
int nextMove(int r){
  cur = nxt[cur][r] ;
  return cur ;  
}

Compilation message

coprobber.cpp: In function 'void dfs(int, int, int)':
coprobber.cpp:23:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for(int i =0 ; i < G[vi].size() ; i++){
      |                    ~~^~~~~~~~~~~~~~
coprobber.cpp:31:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for(int i =0 ; i < G[vj].size() ; i++){
      |                    ~~^~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 35 ms 4748 KB Output is correct
5 Correct 11 ms 3788 KB Output is correct
6 Correct 44 ms 4432 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 512 KB Output is correct
3 Correct 34 ms 4384 KB Output is correct
4 Correct 37 ms 4648 KB Output is correct
5 Correct 37 ms 4408 KB Output is correct
6 Correct 35 ms 4664 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 2 ms 2648 KB Output is correct
12 Correct 0 ms 600 KB Output is correct
13 Correct 1 ms 856 KB Output is correct
14 Correct 2 ms 2648 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 3 ms 2904 KB Output is correct
18 Correct 1 ms 2648 KB Output is correct
19 Correct 0 ms 344 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 35 ms 4748 KB Output is correct
5 Correct 11 ms 3788 KB Output is correct
6 Correct 44 ms 4432 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 512 KB Output is correct
9 Correct 34 ms 4384 KB Output is correct
10 Correct 37 ms 4648 KB Output is correct
11 Correct 37 ms 4408 KB Output is correct
12 Correct 35 ms 4664 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 2648 KB Output is correct
23 Correct 2 ms 2648 KB Output is correct
24 Correct 0 ms 600 KB Output is correct
25 Correct 1 ms 856 KB Output is correct
26 Correct 2 ms 2648 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 3 ms 2904 KB Output is correct
30 Correct 1 ms 2648 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 40 ms 4696 KB Output is correct
36 Correct 10 ms 3472 KB Output is correct
37 Correct 40 ms 4192 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 36 ms 4396 KB Output is correct
41 Correct 35 ms 4564 KB Output is correct
42 Correct 43 ms 4368 KB Output is correct
43 Correct 34 ms 4668 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 596 KB Output is correct
48 Correct 1 ms 2900 KB Output is correct
49 Correct 2 ms 2648 KB Output is correct
50 Correct 1 ms 600 KB Output is correct
51 Correct 1 ms 856 KB Output is correct
52 Correct 2 ms 2648 KB Output is correct
53 Correct 1 ms 600 KB Output is correct
54 Correct 1 ms 856 KB Output is correct
55 Correct 3 ms 2904 KB Output is correct
56 Correct 1 ms 2648 KB Output is correct
57 Correct 3 ms 2904 KB Output is correct
58 Correct 10 ms 3116 KB Output is correct
59 Correct 16 ms 3424 KB Output is correct
60 Correct 326 ms 5448 KB Output is correct
61 Correct 32 ms 3780 KB Output is correct
62 Correct 31 ms 3872 KB Output is correct
63 Correct 224 ms 5420 KB Output is correct
64 Correct 22 ms 3484 KB Output is correct
65 Correct 252 ms 5860 KB Output is correct
66 Correct 51 ms 4336 KB Output is correct
67 Correct 126 ms 5092 KB Output is correct
68 Correct 52 ms 3424 KB Output is correct
69 Correct 0 ms 344 KB Output is correct