Submission #223263

#	Time	Username	Problem	Language	Result	Execution time	Memory
223263		oolimry	Klasika (COCI20_klasika)	C++14	0 / 110	7 ms	5120 KiB

klasika

    #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
• Subtask 2: 0 / 22
• Subtask 3: 0 / 33
• Subtask 4: 0 / 44