oj.uz

답안 #90225

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
90225 2018-12-20T21:27:26 Z nikolapesic2802 경찰관과 강도 (BOI14_coprobber) C++14
100 / 100
 372 ms 15424 KB 
#include <bits/stdc++.h>
#include "coprobber.h"
using namespace std;
#define pb push_back

vector<vector<int> > graph(MAX_N);
int value[MAX_N][MAX_N][2];
int nxt[MAX_N][MAX_N];
int degree[MAX_N][MAX_N];
vector<array<int,3> > todo;
int pos=0;
int start(int N, bool A[MAX_N][MAX_N])
{
    for(int i=0;i<N;i++)
        for(int j=0;j<N;j++)
            if(A[i][j])
                graph[i].pb(j);
    for(int i=0;i<N;i++)
    {
        for(int j=0;j<N;j++)
        {
            if(i==j)
            {
                todo.pb({i,j,0});
                todo.pb({i,j,1});
                value[i][j][0]=1;
                value[i][j][1]=1;
                continue;
            }
            degree[i][j]+=graph[j].size();
        }
    }
    while(todo.size())
    {
        vector<array<int,3> > futuretodo;
        for(auto d:todo){
            int x=d[0],y=d[1],z=d[2];
            if(z==1)
            {
                int i=x,j=y,k=0;
                if(value[i][j][k]==0)
                {
                    value[i][j][k]=1;
                    nxt[i][j]=x;
                    futuretodo.pb({i,j,k});
                }
                for(auto p:graph[x])
                {
                    i=p;j=y;k=0;
                    if(value[i][j][k]==0)
                    {
                        value[i][j][k]=1;
                        nxt[i][j]=x;
                        futuretodo.pb({i,j,k});
                    }
                }
            }
            else
            {
                for(auto p:graph[y])
                {
                    int i=x,j=p,k=1;
                    if(value[i][j][k]==0)
                    {
                        degree[i][j]--;
                        if(degree[i][j]==0)
                        {
                            value[i][j][k]=1;
                            futuretodo.pb({i,j,k});
                        }
                    }
                }
            }
        }
        todo=futuretodo;
    }
    bool t=true;
    for(int i=1;i<N;i++)
        if(value[0][i][0]!=1)
            t=false;
    if(t)
        return 0;
    return -1;
}
int nextMove(int R)
{
    return pos=nxt[pos][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 99 ms 5752 KB Output is correct
5 Correct 17 ms 3136 KB Output is correct
6 Correct 68 ms 6872 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 55 ms 6356 KB Output is correct
4 Correct 52 ms 5884 KB Output is correct
5 Correct 54 ms 6320 KB Output is correct
6 Correct 53 ms 5708 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 432 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 2 ms 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 3 ms 1152 KB Output is correct
11 Correct 4 ms 1408 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 3 ms 1024 KB Output is correct
14 Correct 7 ms 1200 KB Output is correct
15 Correct 3 ms 896 KB Output is correct
16 Correct 3 ms 896 KB Output is correct
17 Correct 7 ms 1660 KB Output is correct
18 Correct 3 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 512 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 53 ms 5756 KB Output is correct
5 Correct 16 ms 3164 KB Output is correct
6 Correct 69 ms 6872 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 63 ms 6352 KB Output is correct
10 Correct 54 ms 5756 KB Output is correct
11 Correct 57 ms 6192 KB Output is correct
12 Correct 55 ms 5740 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 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 7 ms 1280 KB Output is correct
18 Correct 4 ms 1408 KB Output is correct
19 Correct 2 ms 640 KB Output is correct
20 Correct 3 ms 1024 KB Output is correct
21 Correct 4 ms 1280 KB Output is correct
22 Correct 3 ms 1024 KB Output is correct
23 Correct 3 ms 896 KB Output is correct
24 Correct 6 ms 1660 KB Output is correct
25 Correct 3 ms 1152 KB Output is correct
26 Correct 6 ms 2048 KB Output is correct
27 Correct 16 ms 3712 KB Output is correct
28 Correct 23 ms 4736 KB Output is correct
29 Correct 372 ms 15424 KB Output is correct
30 Correct 49 ms 6528 KB Output is correct
31 Correct 49 ms 6784 KB Output is correct
32 Correct 255 ms 13200 KB Output is correct
33 Correct 42 ms 6208 KB Output is correct
34 Correct 305 ms 14368 KB Output is correct
35 Correct 70 ms 8040 KB Output is correct
36 Correct 208 ms 11236 KB Output is correct
37 Correct 73 ms 5784 KB Output is correct
38 Correct 2 ms 384 KB Output is correct