# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
285001 | 3zp | Aesthetic (NOI20_aesthetic) | C++14 | 368 ms | 160660 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>
#define int long long
using namespace std;
const int N = 3000009;
vector<pair<int,int> > v[N];
int ea[N],eb[N],ec[N],g[N],f[N];
/*
00000111111
*/
void ad(int x){
g[x] = 1;
for(auto E : v[x]){
int y = E.first, i = E.second;
if(g[y] == 1 && !f[i]) cout<<1/0;
else if(g[y] == 1) f[i] = 0;
if(g[y] == 0) f[i] = 1;
}
}
int A = 0;
main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
for(int i = 0; i < m; i++){
cin>>ea[i]>>eb[i]>>ec[i];
}
for(int i = m-1; i >= 0; i--){
int a = ea[i], b = eb[i], c = ec[i];
if(a==b)cout<<1/0;
v[a].push_back({b,i});
v[b].push_back({a,i});
}
for(int i=1;i<= n; i++)
ad(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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |