# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1020743 | owoovo | Tug of War (BOI15_tug) | C++17 | 1765 ms | 6664 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>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("popcnt,avx2")
#define ll long long
#define F first
#define S second
using namespace std;
bitset<1200010> bs;
int n,k,sum,d[60010],use[60010],useedge[60010];
vector<pair<pair<int,int>,int>> edge;
vector<int> e[60010];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
bs[0]=1;
cin>>n>>k;
for(int i=0;i<2*n;i++){
int a,b,c;
cin>>a>>b>>c;
sum+=c;
edge.push_back({{a,b+n},c});
e[a].push_back(i);
e[b+n].push_back(i);
d[a]++;
d[b+n]++;
}
queue<int> q;
for(int i=1;i<=2*n;i++){
if(d[i]==1)q.push(i);
}
Compilation message (stderr)
# | 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... |