oj.uz

Submission #223263

# Submission time Handle Problem Language Result Execution time Memory
223263 2020-04-15T06:27:27 Z oolimry Klasika (COCI20_klasika) C++14
0 / 110
 7 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(){
    	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";
    }
    }

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 4992 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 4992 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 5120 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 4992 KB Output isn't correct
2 Halted 0 ms 0 KB -