提出 #896095
ソースコード 拡げる
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#define REP(i,n) for (int i=1;i<=(n);++i)
#define FOR(i,a,b) for (int i=(a);i<=(b);++i)
#define ROF(i,a,b) for (int i=(a);i>=(b);--i)
#define FEC(p,u) for (edge*p=head[u];p;p=p->nxt)
using namespace std;
typedef long long LL;
struct edge{ int b; LL c; edge *nxt; }e[210000], *le(e);
edge *head[110000];
void add(int u, int v, int c){ le->b = v, le->c = c, le->nxt = head[u], head[u] = le++; }
int f[110000];
LL pot[110000], pm[110000];
int inf = 1234567890;
LL INF = 1LL<<60;
LL ma, mpot;
void dfs(int x){
ma = min(ma, pm[x]+pot[x]);
mpot = max(mpot, pot[x]);
FEC(p,x) if (f[p->b] == -1){
f[p->b] = x;
pot[p->b] = pot[x]+p->c;
dfs(p->b);
}
}
int R, C, m;
bool ans = true;
struct res{ int r, c, v; }inp[110000];
bool cmp(res x, res y){ return x.r < y.r || x.r == y.r && x.c < y.c; }
void work() {
sort(inp+1, inp+m+1, cmp);
REP(i,C) pm[i] = inf, head[i] = NULL;
REP(i,m) pm[inp[i].c] = min(pm[inp[i].c], (LL)(inp[i].v));
REP(i,m-1) if (inp[i].r == inp[i+1].r) {
add(inp[i].c, inp[i+1].c, inp[i].v-inp[i+1].v);
add(inp[i+1].c, inp[i].c, inp[i+1].v-inp[i].v);
}
FOR(i,1,C) f[i] = -1, pot[i] = -INF;
FOR(i,1,C) if (f[i] == -1){
ma = INF, mpot = -INF;
f[i] = i; pot[i] = 0; dfs(i);
if (ma < mpot) ans = false;
}
FOR(i,1,C) FEC(p,i) {
if (pot[p->b] != pot[i]+p->c) ans = false;
}
}
int main(){
scanf("%d%d%d", &R, &C, &m);
REP(i,m) scanf("%d%d%d", &inp[i].r, &inp[i].c, &inp[i].v);
work();
REP(i,m) swap(inp[i].r, inp[i].c);
swap(R, C);
le = e;
work();
if (ans) printf("Yes\n"); else printf("No\n");
return 0;
}
提出情報
| 提出日時 |
|
| 問題 |
D - マス目と整数 |
| ユーザ |
crx |
| 言語 |
C++14 (GCC 5.4.1) |
| 得点 |
800 |
| コード長 |
1737 Byte |
| 結果 |
AC |
| 実行時間 |
75 ms |
| メモリ |
8320 KiB |
コンパイルエラー
./Main.cpp: In function ‘int main()’:
./Main.cpp:60:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &R, &C, &m);
^
./Main.cpp:61:59: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP(i,m) scanf("%d%d%d", &inp[i].r, &inp[i].c, &inp[i].v);
^
ジャッジ結果
| セット名 |
Sample |
All |
| 得点 / 配点 |
0 / 0 |
800 / 800 |
| 結果 |
|
|
| セット名 |
テストケース |
| 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 |
| ケース名 |
結果 |
実行時間 |
メモリ |
| 0_00.txt |
AC |
3 ms |
256 KiB |
| 0_01.txt |
AC |
3 ms |
256 KiB |
| 0_02.txt |
AC |
3 ms |
256 KiB |
| 0_03.txt |
AC |
3 ms |
256 KiB |
| 0_04.txt |
AC |
3 ms |
256 KiB |
| 1_00.txt |
AC |
7 ms |
2944 KiB |
| 1_01.txt |
AC |
7 ms |
2944 KiB |
| 1_02.txt |
AC |
7 ms |
2944 KiB |
| 1_03.txt |
AC |
7 ms |
2944 KiB |
| 1_04.txt |
AC |
7 ms |
2944 KiB |
| 1_05.txt |
AC |
7 ms |
2944 KiB |
| 1_06.txt |
AC |
52 ms |
4096 KiB |
| 1_07.txt |
AC |
56 ms |
4096 KiB |
| 1_08.txt |
AC |
58 ms |
5760 KiB |
| 1_09.txt |
AC |
58 ms |
5760 KiB |
| 1_10.txt |
AC |
64 ms |
6528 KiB |
| 1_11.txt |
AC |
75 ms |
6528 KiB |
| 1_12.txt |
AC |
73 ms |
8064 KiB |
| 1_13.txt |
AC |
72 ms |
8064 KiB |
| 1_14.txt |
AC |
72 ms |
8064 KiB |
| 1_15.txt |
AC |
71 ms |
8064 KiB |
| 1_16.txt |
AC |
65 ms |
7552 KiB |
| 1_17.txt |
AC |
68 ms |
8064 KiB |
| 1_18.txt |
AC |
69 ms |
7808 KiB |
| 1_19.txt |
AC |
69 ms |
7808 KiB |
| 1_20.txt |
AC |
44 ms |
4608 KiB |
| 1_21.txt |
AC |
20 ms |
2304 KiB |
| 1_22.txt |
AC |
7 ms |
2048 KiB |
| 1_23.txt |
AC |
40 ms |
4224 KiB |
| 1_24.txt |
AC |
55 ms |
5504 KiB |
| 1_25.txt |
AC |
42 ms |
3840 KiB |
| 1_26.txt |
AC |
6 ms |
640 KiB |
| 1_27.txt |
AC |
11 ms |
2944 KiB |
| 1_28.txt |
AC |
68 ms |
7040 KiB |
| 1_29.txt |
AC |
22 ms |
2560 KiB |
| 1_30.txt |
AC |
64 ms |
6656 KiB |
| 1_31.txt |
AC |
26 ms |
3712 KiB |
| 1_32.txt |
AC |
59 ms |
5504 KiB |
| 1_33.txt |
AC |
64 ms |
6528 KiB |
| 1_34.txt |
AC |
11 ms |
2048 KiB |
| 1_35.txt |
AC |
66 ms |
7552 KiB |
| 1_36.txt |
AC |
13 ms |
2816 KiB |
| 1_37.txt |
AC |
28 ms |
2688 KiB |
| 1_38.txt |
AC |
46 ms |
4864 KiB |
| 1_39.txt |
AC |
16 ms |
2432 KiB |
| 1_40.txt |
AC |
46 ms |
5376 KiB |
| 1_41.txt |
AC |
23 ms |
3456 KiB |
| 1_42.txt |
AC |
60 ms |
6016 KiB |
| 1_43.txt |
AC |
42 ms |
4608 KiB |
| 1_44.txt |
AC |
60 ms |
8320 KiB |
| 1_45.txt |
AC |
21 ms |
3840 KiB |
| 1_46.txt |
AC |
61 ms |
5760 KiB |
| 1_47.txt |
AC |
25 ms |
4608 KiB |
| 1_48.txt |
AC |
20 ms |
1920 KiB |
| 1_49.txt |
AC |
9 ms |
1536 KiB |
| 1_50.txt |
AC |
37 ms |
4224 KiB |
| 1_51.txt |
AC |
63 ms |
5888 KiB |
| 1_52.txt |
AC |
9 ms |
2816 KiB |
| 1_53.txt |
AC |
13 ms |
2944 KiB |
| 1_54.txt |
AC |
21 ms |
3200 KiB |
| 1_55.txt |
AC |
30 ms |
4352 KiB |
| 1_56.txt |
AC |
46 ms |
5504 KiB |
| 1_57.txt |
AC |
68 ms |
6400 KiB |
| 1_58.txt |
AC |
56 ms |
5888 KiB |
| 1_59.txt |
AC |
7 ms |
2048 KiB |
| 1_60.txt |
AC |
3 ms |
256 KiB |
| 1_61.txt |
AC |
3 ms |
256 KiB |
| 1_62.txt |
AC |
3 ms |
256 KiB |
| 1_63.txt |
AC |
3 ms |
256 KiB |