Submission #2546181
Source Code Expand
#include <bits/stdc++.h> #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define rep(i,n) FOR(i,0,n) #define RFOR(i,a,b) for(int i=(a)-1;i>=(b);i--) #define rrep(i,n) RFOR(i,n,0) using namespace std; typedef long long ll; typedef unsigned long long ull; const ll INF = 1e17; struct dat{ ll x, y, d; bool operator<(dat& right) const{ if(x != right.x) return x < right.x; else return y < right.y; } }; int main() { cin.tie(0); ios::sync_with_stdio(false); int n,m; cin >> n >> m; vector<dat> v; rep(i,m){ ll l, r, d; cin >> l >> r >> d; l--; r--; if(l>r){ v.push_back(dat{r, l, -d}); }else{ v.push_back(dat{l, r, d}); } } sort(v.begin(), v.end()); ll d[n]; rep(i,n) d[i] = INF; d[0] = 0; rep(i,v.size()){ dat a = v[i]; if(d[a.x] != INF && d[a.y] != INF){ if(d[a.y] - d[a.x] != a.d){ cout << "No" << endl; return 0; } }else if(d[a.x] != INF){ d[a.y] = d[a.x] + a.d; }else if(d[a.y] != INF){ d[a.x] = d[a.y] - a.d; }else{ d[a.x] = 0; d[a.y] = a.d; } } cout << "Yes" << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - People on a Line |
User | misora192 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1131 Byte |
Status | WA |
Exec Time | 67 ms |
Memory | 8560 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, sample01.txt, sample02.txt, sample03.txt, sample04.txt, sample05.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 65 ms | 7792 KB |
02.txt | WA | 65 ms | 7920 KB |
03.txt | AC | 67 ms | 7408 KB |
04.txt | WA | 66 ms | 7920 KB |
05.txt | AC | 57 ms | 8304 KB |
06.txt | WA | 48 ms | 8048 KB |
07.txt | AC | 56 ms | 6768 KB |
08.txt | WA | 45 ms | 7152 KB |
09.txt | WA | 40 ms | 3952 KB |
10.txt | WA | 38 ms | 4340 KB |
11.txt | AC | 39 ms | 4212 KB |
12.txt | AC | 48 ms | 7664 KB |
13.txt | WA | 53 ms | 7792 KB |
14.txt | WA | 41 ms | 4212 KB |
15.txt | AC | 48 ms | 7152 KB |
16.txt | AC | 41 ms | 4080 KB |
17.txt | WA | 60 ms | 7280 KB |
18.txt | WA | 56 ms | 7920 KB |
19.txt | WA | 45 ms | 7792 KB |
20.txt | WA | 45 ms | 8560 KB |
21.txt | AC | 60 ms | 8304 KB |
22.txt | AC | 45 ms | 8560 KB |
23.txt | AC | 60 ms | 7024 KB |
24.txt | AC | 45 ms | 8560 KB |
25.txt | WA | 61 ms | 8048 KB |
26.txt | WA | 61 ms | 7280 KB |
27.txt | WA | 34 ms | 3568 KB |
28.txt | WA | 45 ms | 8560 KB |
29.txt | WA | 34 ms | 3568 KB |
30.txt | WA | 42 ms | 4080 KB |
31.txt | WA | 34 ms | 3568 KB |
32.txt | WA | 41 ms | 4080 KB |
33.txt | AC | 60 ms | 8560 KB |
34.txt | AC | 60 ms | 7792 KB |
35.txt | AC | 34 ms | 4468 KB |
36.txt | AC | 45 ms | 7536 KB |
37.txt | AC | 34 ms | 3568 KB |
38.txt | AC | 42 ms | 4080 KB |
39.txt | AC | 34 ms | 3568 KB |
40.txt | AC | 41 ms | 4212 KB |
41.txt | AC | 2 ms | 1024 KB |
42.txt | AC | 23 ms | 3444 KB |
sample01.txt | AC | 1 ms | 256 KB |
sample02.txt | AC | 1 ms | 256 KB |
sample03.txt | AC | 1 ms | 256 KB |
sample04.txt | AC | 1 ms | 256 KB |
sample05.txt | AC | 1 ms | 256 KB |