Submission #90139

#	Time^UTC-0	Username	Problem	Language	Result	Execution time	Memory
90139	2018-12-20 15:00:49	nikolapesic2802	Cop and Robber (BOI14_coprobber)	C++14	0 / 100	59 ms	7672 KiB

This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.

coprobber

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#include "coprobber.h"
using namespace std;
#define pb push_back
pair<int,int> dp[MAX_N][MAX_N][2];
vector<vector<int> > graf(MAX_N);
int visited[MAX_N][MAX_N][2];
int calc(int cop,int robber,int move)
{
    if(visited[cop][robber][move]==2)
        return dp[cop][robber][move].first;
    //printf("Racunam %i %i %i\n",cop,robber,move);
    visited[cop][robber][move]=1;
    if(move==0)
    {
        if(visited[cop][robber][1]==0||visited[cop][robber][1]==2)
        {
            int d=calc(cop,robber,1);
            if(d!=-1)
            {
                d++;
                if(dp[cop][robber][move].first==-1||dp[cop][robber][move].first>d)
                    dp[cop][robber][move]=make_pair(d,cop);
            }
        }
        for(auto p:graf[cop])
        {
            if(visited[p][robber][1]==1)
                continue;
            int d=calc(p,robber,1);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Subtask 10 / 16

#	Verdict	Execution time	Memory	Grader output
Fetching results...

Subtask 20 / 14

#	Verdict	Execution time	Memory	Grader output
Fetching results...

Subtask 30 / 30

#	Verdict	Execution time	Memory	Grader output
Fetching results...

Subtask 40 / 40

#	Verdict	Execution time	Memory	Grader output
Fetching results...