提出 #7878842


ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

#define REP(i, stop) for (signed i = 0; i < stop; ++i)

#define S(i, j) ip[i * (N + 1) + j]

const signed is = 1 << 16;
char ib[is], *ip = ib, it;

using P = pair<int, int>;
signed N;
queue<P> que;
int parity[200];
P bfs(int s) {
	REP(i, N) parity[i] = -1;
	P p;
	que.push({s, 1});
	parity[s] = 0;
	while (!que.empty()) {
		p = que.front();
		que.pop();
		int i = p.first;
		int d = p.second;
		REP(j, N) {
			if (S(i, j) == '0') continue;
			if (parity[j] == -1) {
				parity[j] = 1 - parity[i];
				que.push({j, d + 1});
			} else if (parity[i] == parity[j]) {
				puts("-1\n");
				exit(0);
			}
		}
	}
	return p;
}

signed main() {
	fread_unlocked(ib, 1, is, stdin);
	while ((it = *ip++) != '\n') {
		N = N * 10 + it - '0';
	}
	P p = bfs(1);
	p = bfs(p.first);
	printf("%d\n", p.second);
}

提出情報

提出日時
問題 B - Graph Partition
ユーザ n4o847
言語 C++14 (GCC 5.4.1)
得点 500
コード長 841 Byte
結果 AC
実行時間 1 ms
メモリ 256 KiB

コンパイルエラー

./Main.cpp: In function ‘int main()’:
./Main.cpp:40:34: warning: ignoring return value of ‘size_t fread_unlocked(void*, size_t, size_t, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
  fread_unlocked(ib, 1, is, stdin);
                                  ^

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 500 / 500
結果
AC × 3
AC × 55
セット名 テストケース
Sample s1.txt, s2.txt, s3.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, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, s1.txt, s2.txt, s3.txt
ケース名 結果 実行時間 メモリ
01.txt AC 1 ms 256 KiB
02.txt AC 1 ms 256 KiB
03.txt AC 1 ms 256 KiB
04.txt AC 1 ms 256 KiB
05.txt AC 1 ms 256 KiB
06.txt AC 1 ms 256 KiB
07.txt AC 1 ms 256 KiB
08.txt AC 1 ms 256 KiB
09.txt AC 1 ms 256 KiB
10.txt AC 1 ms 256 KiB
11.txt AC 1 ms 256 KiB
12.txt AC 1 ms 256 KiB
13.txt AC 1 ms 256 KiB
14.txt AC 1 ms 256 KiB
15.txt AC 1 ms 256 KiB
16.txt AC 1 ms 256 KiB
17.txt AC 1 ms 256 KiB
18.txt AC 1 ms 256 KiB
19.txt AC 1 ms 256 KiB
20.txt AC 1 ms 256 KiB
21.txt AC 1 ms 256 KiB
22.txt AC 1 ms 256 KiB
23.txt AC 1 ms 256 KiB
24.txt AC 1 ms 256 KiB
25.txt AC 1 ms 256 KiB
26.txt AC 1 ms 256 KiB
27.txt AC 1 ms 256 KiB
28.txt AC 1 ms 256 KiB
29.txt AC 1 ms 256 KiB
30.txt AC 1 ms 256 KiB
31.txt AC 1 ms 256 KiB
32.txt AC 1 ms 256 KiB
33.txt AC 1 ms 256 KiB
34.txt AC 1 ms 256 KiB
35.txt AC 1 ms 256 KiB
36.txt AC 1 ms 256 KiB
37.txt AC 1 ms 256 KiB
38.txt AC 1 ms 256 KiB
39.txt AC 1 ms 256 KiB
40.txt AC 1 ms 256 KiB
41.txt AC 1 ms 256 KiB
42.txt AC 1 ms 256 KiB
43.txt AC 1 ms 256 KiB
44.txt AC 1 ms 256 KiB
45.txt AC 1 ms 256 KiB
46.txt AC 1 ms 256 KiB
47.txt AC 1 ms 256 KiB
48.txt AC 1 ms 256 KiB
49.txt AC 1 ms 256 KiB
50.txt AC 1 ms 256 KiB
51.txt AC 1 ms 256 KiB
52.txt AC 1 ms 256 KiB
s1.txt AC 1 ms 256 KiB
s2.txt AC 1 ms 256 KiB
s3.txt AC 1 ms 256 KiB