Submission #298014

#	Time	Username	Problem	Language	Result	Execution time	Memory
298014		naderjemel	경찰관과 강도 (BOI14_coprobber)	C++14	0 / 100	3069 ms	262148 KiB

coprobber

    #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;
            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)
    {
        par = old;
        old = p;
        p = solve(p,par,R);
        return p;
    }

Compilation message (stderr)

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

• Subtask 1: 0 / 16
• Subtask 2: 0 / 14
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40