oj.uz

Submission #732966

# Submission time Handle Problem Language Result Execution time Memory
732966 2023-04-29T22:24:10 Z n0sk1ll Cop and Robber (BOI14_coprobber) C++17
60 / 100
 682 ms 262144 KB 
#include "coprobber.h"

#include <bits/stdc++.h>

#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)

using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;







//Note to self: Check for overflow

int dje[503][503]; //ako policajac na potezu pobedjuje, gde treba ici?
int zauz[503][503][2]; //<0 ako smo vec izracunali xd
bool dp[503][503][2]; //canwin
//0 - pandur na potezu
//1 - crook na potezu

graph g(505);

int P;

int start(int n, bool A[500][500])
{
    ff(i,0,n) ff(j,i+1,n) if (A[i][j]) g[i].pb(j),g[j].pb(i);

    queue<pair<pii,pii>> bfs;
    ff(i,0,n) bfs.push({{i,i},{0,-1}}),bfs.push({{i,i},{1,-1}});

    //ovo vazi samo kad je lopov na potezu
    ff(i,0,n) ff(j,0,n) zauz[i][j][1]+=(int)g[j].size();
    ff(i,0,n) ff(j,0,n) zauz[i][j][0]=mod;

    while (!bfs.empty())
    {
        int p=bfs.front().xx.xx;
        int l=bfs.front().xx.yy;
        bool ko=bfs.front().yy.xx;
        int okle=bfs.front().yy.yy;
        bfs.pop();

        if (zauz[p][l][ko]<0) continue;

        zauz[p][l][ko]=-1;
        dp[p][l][ko]=true;
        if (ko==0) dje[p][l]=okle;

        if (ko) //crook na trenutnom potezu
        {
            //znaci policajac je bio na proslom
            bfs.push({{p,l},{0,p}});
            for (auto pugde : g[p])
                bfs.push({{pugde,l},{0,p}});

        }
        else //policajac na potezu
        {
            //znaci crook je bio na proslom
            for (auto lugde : g[l])
            {
                zauz[p][lugde][1]--;
                if (zauz[p][lugde][1]==0)
                    bfs.push({{p,lugde},{1,-1}});
            }
        }
    }

    /*cout<<"policajac:"<<endl;
    ff(i,0,n)
    {
        ff(j,0,n) cout<<dp[i][j][0]<<" ";
        cout<<endl;
    } cout<<endl;

    cout<<"lopov:"<<endl;
    ff(i,0,n)
    {
        ff(j,0,n) cout<<dp[i][j][1]<<" ";
        cout<<endl;
    } cout<<endl;

    cout<<"jebem ti kurac:"<<endl;
    ff(i,0,n)
    {
        ff(j,0,n) cout<<dje[i][j]<<" ";
        cout<<endl;
    } cout<<endl;
    cout<<endl;*/

    ff(i,0,n)
    {
        bool moze=true;
        ff(j,0,n) if (!dp[i][j][0]) moze=false;
        if (moze) return P=i,i;
    }

    return -1;
}

int nextMove(int R)
{
    return P=dje[P][R],P;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 62 ms 5192 KB Output is correct
5 Correct 17 ms 2880 KB Output is correct
6 Correct 65 ms 6320 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 72 ms 6144 KB Output is correct
4 Correct 60 ms 5348 KB Output is correct
5 Correct 66 ms 6304 KB Output is correct
6 Correct 69 ms 5216 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 0 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 0 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 464 KB Output is correct
10 Correct 2 ms 976 KB Output is correct
11 Correct 3 ms 1104 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Correct 1 ms 848 KB Output is correct
14 Correct 3 ms 1232 KB Output is correct
15 Correct 2 ms 976 KB Output is correct
16 Correct 2 ms 1104 KB Output is correct
17 Correct 13 ms 6736 KB Output is correct
18 Correct 2 ms 976 KB Output is correct
19 Correct 0 ms 336 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 62 ms 5192 KB Output is correct
5 Correct 17 ms 2880 KB Output is correct
6 Correct 65 ms 6320 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 72 ms 6144 KB Output is correct
10 Correct 60 ms 5348 KB Output is correct
11 Correct 66 ms 6304 KB Output is correct
12 Correct 69 ms 5216 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 0 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 0 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 464 KB Output is correct
22 Correct 2 ms 976 KB Output is correct
23 Correct 3 ms 1104 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 848 KB Output is correct
26 Correct 3 ms 1232 KB Output is correct
27 Correct 2 ms 976 KB Output is correct
28 Correct 2 ms 1104 KB Output is correct
29 Correct 13 ms 6736 KB Output is correct
30 Correct 2 ms 976 KB Output is correct
31 Correct 0 ms 336 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 59 ms 5336 KB Output is correct
36 Correct 16 ms 2840 KB Output is correct
37 Correct 90 ms 6324 KB Output is correct
38 Correct 0 ms 336 KB Output is correct
39 Correct 0 ms 336 KB Output is correct
40 Correct 80 ms 6124 KB Output is correct
41 Correct 62 ms 5292 KB Output is correct
42 Correct 70 ms 6364 KB Output is correct
43 Correct 63 ms 5172 KB Output is correct
44 Correct 0 ms 336 KB Output is correct
45 Correct 0 ms 336 KB Output is correct
46 Correct 0 ms 336 KB Output is correct
47 Correct 1 ms 464 KB Output is correct
48 Correct 2 ms 976 KB Output is correct
49 Correct 3 ms 1184 KB Output is correct
50 Correct 1 ms 464 KB Output is correct
51 Correct 1 ms 848 KB Output is correct
52 Correct 3 ms 1232 KB Output is correct
53 Correct 2 ms 976 KB Output is correct
54 Correct 3 ms 1104 KB Output is correct
55 Correct 15 ms 6852 KB Output is correct
56 Correct 2 ms 976 KB Output is correct
57 Correct 4 ms 1744 KB Output is correct
58 Correct 14 ms 3228 KB Output is correct
59 Correct 23 ms 4008 KB Output is correct
60 Runtime error 682 ms 262144 KB Execution killed with signal 9
61 Halted 0 ms 0 KB -