# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
285023 | 2020-08-28T09:04:02 Z | 3zp | Aesthetic (NOI20_aesthetic) | C++14 | 334 ms | 98172 KB |
#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] = 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]; v[a].push_back({b,i}); v[b].push_back({a,i}); } for(int i=1;i<= n; i++) ad(i); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 44 ms | 70776 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 44 ms | 70776 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 331 ms | 97912 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 334 ms | 98172 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 285 ms | 96688 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 285 ms | 96688 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 44 ms | 70776 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |