| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1104427 | Faggi | Regions (IOI09_regions) | C++11 | 108 ms | 1872 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int main(){ int n, r, q, i, a, b; cin >> n >> r >> q; vector<int>reg(n+1),sup(n+1); cin >> reg[1]; for(i=2; i<=n; i++) { cin >> sup[i] >> reg[i]; } while(q--)
{
cin >> a >> b; }
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
