Submission #1223835

#TimeUsernameProblemLanguageResultExecution timeMemory
1223835nikulid열쇠 (IOI21_keys)C++20
0 / 100
0 ms320 KiB
#include <vector> // #include <iostream> using namespace std; //#define dout if(1==1)cout #define pb push_back #define mp make_pair /* AAARRGGHHHH */ vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) { int n=r.size(); int m=u.size(); vector<vector<int>> adj(n); for(int i=0; i<m; i++){ adj[u[i]].pb(v[i]); adj[v[i]].pb(u[i]); } // vector<int> reach(n); vector<int> ans(n, 1); // subtask 1: c[j]=0 for all j for(int i=0; i<n; i++){ // check room i.. if(r[i]!=0 || adj[i].size()==0){ ans[i]=1; } else{ ans[i]=0; } } return ans; }
#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...