Submission #1220022

#TimeUsernameProblemLanguageResultExecution timeMemory
1220022jellybean열쇠 (IOI21_keys)C++20
0 / 100
0 ms320 KiB
#include <bits/stdc++.h> using namespace std; #define fi first #define se second #define pb push_back typedef pair<int,int> pii; std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) { int n = r.size(), m = c.size(); vector<int> ans; bool k[n] = {}; for(int i=0; i<m; i++) k[u[i]] = 1, k[v[i]] = 1; for(int i=0; i<n; i++) { if(!k[i] or r[i]) ans.pb(1); else ans.pb(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...