oj.uz

Submission #298001

# Submission time Handle Problem Language Result Execution time Memory
298001 2020-09-12T09:26:45 Z naderjemel Cop and Robber (BOI14_coprobber) C++14
0 / 100
 193 ms 262148 KB 
#include "coprobber.h"
#include <vector>
#include <set>
#include <bits/stdc++.h>

using namespace std;

vector<set<int>> kid;
vector<vector<int>> adj;
vector<int> path;
int n,p,par,old=-1;
void calc(int u, int p){
    path.push_back(u);
    for(auto v:adj[u]){
        if(v==p) continue;
        calc(v,u);
    }
    path.pop_back();
    for(auto i:path){
        kid[i].insert(u);
    }
}
int solve(int u, int p, int r) {
    for (auto v:adj[u]) {
        if (v == p) continue;
        printf("fun: %d %d\n",p,r);
        if (v == r) return r;
        if (kid[v].find(r) != kid[v].end()) return v;
    }
}
int start(int N, bool A[MAX_N][MAX_N]){
    n=N;
    kid.resize(N+2,set<int>());
    adj.resize(N+2,vector<int>());
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(A[i][j]){
                adj[i].push_back(j);
                adj[j].push_back(i);
            }
        }
    }
    calc(0,-1);
    return p=0;
}

int nextMove(int R)
{
    printf("%d\n",p);
    par = old;
    old = p;
    p = solve(p,par,R);
    printf("%d %d\n",p,R);
    return p;
}

Compilation message

coprobber.cpp: In function 'int solve(int, int, int)':
coprobber.cpp:30:1: warning: control reaches end of non-void function [-Wreturn-type]
   30 | }
      | ^

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Failed 0 ms 384 KB HACKED
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 193 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Failed 0 ms 384 KB HACKED
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Failed 0 ms 384 KB HACKED
2 Halted 0 ms 0 KB -