| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1223819 | nikulid | Keys (IOI21_keys) | C++20 | 0 ms | 324 KiB |
#include <vector>
using namespace std;
/*
AAARRGGHHHH
*/
vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
int n=r.size();
vector<int> ans(r.size(), 1);
// subtask 1: c[j]=0 for all j
for(int i=0; i<n; i++){
if(r[i]==0){
ans[i]=1;
} else{
ans[i]=0;
}
}
return ans;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
