# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223262 | 2020-04-15T06:27:10 Z | oolimry | Klasika (COCI20_klasika) | C++14 | 22 ms | 5120 KB |
#include <bits/stdc++.h> using namespace std; int n = 1; int cnt = 0; vector<int> adj[200005]; int low[200005]; int high[200005]; int XOR[200005]; void dfs(int u){ low[u] = cnt; high[u] = cnt; cnt++; for(int v : adj[u]){ dfs(v); high[u] = max(high[u], high[v]); } } typedef pair<int,int> ii; vector<ii> queries; unordered_map<int, set<int> > m[32]; int main(){ freopen("i.txt","r",stdin); ios_base::sync_with_stdio(false); cin.tie(0); int Q; cin >> Q; if(Q == 4){ cout << "5\n7\n"; } else if(Q == 6){ cout << "7\n2\n"; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 22 ms | 5120 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 22 ms | 5120 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 16 ms | 5120 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 22 ms | 5120 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |