Submission #1151118
Source Code Expand
#include <cstdio> #include <iostream> #include <cmath> #include <cstring> #include <sstream> #include <algorithm> #include <cstdlib> #include <map> #include <queue> #include <utility> #include <vector> #include <set> #include <memory.h> #include <iomanip> #include <bitset> #include <list> #include <stack> using namespace std; #define mod 1000000007 int main() { int r, c, n; cin >> r >> c >> n; vector<long long int> sub(100010, mod); // sub[i] : i + 1列目 - i列目の値 map<pair<int, int>, long long int> m; vector<vector<int> > rv(100001), cv(100001); priority_queue<pair<int, int> > qu; for(int i = 0; i < n; i++){ int rr, cc, a; cin >> rr >> cc >> a; m[make_pair(rr, cc)] = a; qu.push(make_pair(rr, cc)); rv[rr].push_back(cc); cv[cc].push_back(rr); } while(!qu.empty()){ int rr = (qu.top()).first; int cc = (qu.top()).second; // cout << rr << " " << cc << endl; if(m[make_pair(rr, cc)] < 0){ cout << "No" << endl; return 0; } qu.pop(); if(rr > 1){ if(m.find(make_pair(rr - 1, cc)) != m.end()){ // 1つ上の値がわかっているとき long long int tmp = m[make_pair(rr, cc)] - m[make_pair(rr - 1, cc)]; if(sub[rr - 1] == mod){ sub[rr - 1] = tmp; for(int i = 0; i < rv[rr].size(); i++){ qu.push(make_pair(rr, rv[rr][i])); } for(int i = 0; i < rv[rr - 1].size(); i++){ qu.push(make_pair(rr - 1, rv[rr - 1][i])); } } else if(sub[rr - 1] != tmp){ cout << "No" << endl; return 0; } } else { // 1つ上の値がわかっていないとき if(sub[rr - 1] != mod){ // rr行目とrr - 1行目の差がわかっているときは値を設定する m[make_pair(rr - 1, cc)] = m[make_pair(rr, cc)] - sub[rr - 1]; qu.push(make_pair(rr - 1, cc)); } } } if(rr < r){ if(m.find(make_pair(rr + 1, cc)) != m.end()){ // 1つ下の値がわかっているとき long long int tmp = m[make_pair(rr + 1, cc)] - m[make_pair(rr, cc)]; if(sub[rr] == mod){ sub[rr] = tmp; for(int i = 0; i < rv[rr].size(); i++){ qu.push(make_pair(rr, rv[rr][i])); } for(int i = 0; i < rv[rr + 1].size(); i++){ qu.push(make_pair(rr + 1, rv[rr + 1][i])); } } else if(sub[rr] != tmp){ cout << "No" << endl; return 0; } } else { // わかっていないとき if(sub[rr] != mod){ // rr + 1行目とrr行目の差がわかっているときは値を設定する m[make_pair(rr + 1, cc)] = sub[rr] + m[make_pair(rr, cc)]; qu.push(make_pair(rr + 1, cc)); } } } } cout << "Yes" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Grid and Integers |
User | maple |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 2727 Byte |
Status | WA |
Exec Time | 241 ms |
Memory | 19060 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 800 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt, 1_56.txt, 1_57.txt, 1_58.txt, 1_59.txt, 1_60.txt, 1_61.txt, 1_62.txt, 1_63.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 4 ms | 5760 KB |
0_01.txt | AC | 4 ms | 5760 KB |
0_02.txt | AC | 3 ms | 5760 KB |
0_03.txt | AC | 4 ms | 5760 KB |
0_04.txt | AC | 4 ms | 5760 KB |
1_00.txt | AC | 3 ms | 5760 KB |
1_01.txt | AC | 4 ms | 5760 KB |
1_02.txt | AC | 4 ms | 5760 KB |
1_03.txt | WA | 4 ms | 5760 KB |
1_04.txt | AC | 4 ms | 5760 KB |
1_05.txt | WA | 4 ms | 5760 KB |
1_06.txt | AC | 184 ms | 19060 KB |
1_07.txt | AC | 192 ms | 19060 KB |
1_08.txt | AC | 172 ms | 16884 KB |
1_09.txt | WA | 167 ms | 16884 KB |
1_10.txt | AC | 195 ms | 15860 KB |
1_11.txt | WA | 192 ms | 15860 KB |
1_12.txt | AC | 192 ms | 15860 KB |
1_13.txt | WA | 196 ms | 15860 KB |
1_14.txt | AC | 191 ms | 15860 KB |
1_15.txt | WA | 191 ms | 15860 KB |
1_16.txt | AC | 166 ms | 15860 KB |
1_17.txt | AC | 150 ms | 15860 KB |
1_18.txt | AC | 149 ms | 15860 KB |
1_19.txt | AC | 160 ms | 15860 KB |
1_20.txt | WA | 119 ms | 11768 KB |
1_21.txt | AC | 52 ms | 8956 KB |
1_22.txt | AC | 9 ms | 6144 KB |
1_23.txt | AC | 114 ms | 12664 KB |
1_24.txt | WA | 156 ms | 13172 KB |
1_25.txt | WA | 121 ms | 11896 KB |
1_26.txt | AC | 13 ms | 6400 KB |
1_27.txt | AC | 21 ms | 7040 KB |
1_28.txt | WA | 187 ms | 15604 KB |
1_29.txt | AC | 59 ms | 9468 KB |
1_30.txt | WA | 177 ms | 15352 KB |
1_31.txt | AC | 68 ms | 10104 KB |
1_32.txt | WA | 155 ms | 13300 KB |
1_33.txt | WA | 177 ms | 15352 KB |
1_34.txt | AC | 23 ms | 7168 KB |
1_35.txt | AC | 241 ms | 17780 KB |
1_36.txt | AC | 26 ms | 7296 KB |
1_37.txt | WA | 73 ms | 9464 KB |
1_38.txt | AC | 135 ms | 13560 KB |
1_39.txt | AC | 41 ms | 8316 KB |
1_40.txt | AC | 127 ms | 13432 KB |
1_41.txt | AC | 59 ms | 9596 KB |
1_42.txt | WA | 162 ms | 13556 KB |
1_43.txt | WA | 116 ms | 12664 KB |
1_44.txt | WA | 155 ms | 14068 KB |
1_45.txt | WA | 47 ms | 8444 KB |
1_46.txt | WA | 172 ms | 15096 KB |
1_47.txt | AC | 58 ms | 9084 KB |
1_48.txt | WA | 54 ms | 8828 KB |
1_49.txt | AC | 19 ms | 6912 KB |
1_50.txt | WA | 97 ms | 11256 KB |
1_51.txt | WA | 175 ms | 14580 KB |
1_52.txt | AC | 13 ms | 6528 KB |
1_53.txt | AC | 27 ms | 7424 KB |
1_54.txt | AC | 52 ms | 8956 KB |
1_55.txt | AC | 73 ms | 9848 KB |
1_56.txt | WA | 123 ms | 12536 KB |
1_57.txt | WA | 186 ms | 14964 KB |
1_58.txt | WA | 151 ms | 14068 KB |
1_59.txt | AC | 10 ms | 6272 KB |
1_60.txt | AC | 4 ms | 5760 KB |
1_61.txt | AC | 4 ms | 5760 KB |
1_62.txt | AC | 4 ms | 5760 KB |
1_63.txt | AC | 4 ms | 5760 KB |