# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
387293 | kshitij_sodani | Tug of War (BOI15_tug) | C++14 | 63 ms | 36076 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.
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
//#define endl '\n'
int n,k;
int aa[300001];
int bb[300001];
int it[300001];
set<int> pre[300001];
vector<int> adj[300001];
vector<int> adj2[300001];
int vis[300001];
void add(int i,int j){
adj[2*i+1].pb(2*j);
adj[2*j+1].pb(2*i);
/*cout<<2*i+1<<"<<"<<2*j<<endl;
cout<<2*j+1<<"<<"<<2*i<<endl;
cout<<endl;*/
}
void add2(int i,int j){
adj[2*i].pb(2*j+1);
adj[2*j].pb(2*i+1);
/*cout<<2*i+1<<"<<"<<2*j<<endl;
# | 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... |