제출 #969653

#제출 시각아이디문제언어결과실행 시간메모리
969653anton게임 (APIO22_game)C++17
30 / 100
21 ms856 KiB
#include "game.h" #include<bits/stdc++.h> using namespace std; #define pii pair<int, int> const int MAX_N = 1e3; vector<int> adj[MAX_N]; vector<int> rev_adj[MAX_N]; int min_acc[MAX_N]; int N, K; void rev_dfs(int u, int acc){ min_acc[u] = acc; for(auto e: rev_adj[u]){ if(min_acc[e]>acc){ rev_dfs(e, acc); } } } void init(int n, int k) { N= n, K = k; for(int i = 0; i<k-1; i++){ adj[i].push_back(i+1); rev_adj[i+1].push_back(i); } } int add_teleporter(int u, int v) { adj[u].push_back(v); rev_adj[v].push_back(u); for(int i = 0; i<N; i++){ min_acc[i] = 1e9; } for(int i = 0; i<K; i++){ //cout<<min_acc[i]<<" "; if(min_acc[i]<i){ return 1; } else{ for(auto e: rev_adj[i]){ if(min_acc[e]>i){ rev_dfs(e, i); } } } if(min_acc[i]<=i){ return 1; } } //cout<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...