제출 #1220020

#제출 시각아이디문제언어결과실행 시간메모리
1220020jellybeanKeys (IOI21_keys)C++20
0 / 100
0 ms320 KiB
#include <bits/stdc++.h> using namespace std; #define fi first #define se second 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(n); 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[i] = 1; 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...