oj.uz

답안 #132522

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
132522 2019-07-19T05:42:05 Z sean617 산만한 고양이 (KOI17_cat) C++
35 / 100
 1059 ms 24664 KB 
#include <iostream>
#include <cstdio>
#include <vector>
#define N 300005
using namespace std;

typedef long long ll;
ll n, m, k, s, v[N], cnt[N];
bool z, u[N];
vector<ll> a[N], k1, k2;
void f(ll p, ll q) {
	ll i, num;
	if (v[p] == k) {z = 1; return;}
	v[p] = k;
	for (i =0; i < a[p].size(); i++) {
		num = a[p][i];
		if (num == q || num == k) continue;
		f(num, p);
	}
}
int main()
{
	ll i, j, t1, t2;
	cin >> n >> m;
	while (m--) {
		scanf ("%lld %lld", &t1, &t2);
		a[t1].push_back(t2);
		a[t2].push_back(t1);
		if (t1 > t2) swap(t1, t2);
		if (t1 == t2 -1) u[t1] = 1;
		else if (t1 == 1 && t2 == n) u[n] = 1;
		else {
			k1.push_back(t1);
			k2.push_back(t2);
		}
	}

	if (n <= 5000 && m <= 5000) {
		for (k = 1; k <= n; k++) {
			for (j = 1; j <= n; j++) {
				if (v[j] == k || j == k) continue;
				z = 0;
				f(j, 0);
				if (z) break;
			}
			if (j > n) s += k;
		}
		cout << s;
		return 0;
	}
	for (i = 1; i <= n; i++) {
		if (!u[i]) break;
	}
	if (i > n) {
		for (i = 0; i < k1.size(); i++) {
			cnt[k1[i]]++;
			cnt[k2[i]]++;
		}
		for (i = 1; i <= n; i++) {
			if (cnt[i] == k1.size()) s += i;
		}
		cout << s;
		return 0;
	}
    cout << 0;
    return 0;
}

Compilation message

cat.cpp: In function 'void f(ll, ll)':
cat.cpp:15:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (i =0; i < a[p].size(); i++) {
             ~~^~~~~~~~~~~~~
cat.cpp: In function 'int main()':
cat.cpp:55:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (i = 0; i < k1.size(); i++) {
               ~~^~~~~~~~~~~
cat.cpp:60:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (cnt[i] == k1.size()) s += i;
        ~~~~~~~^~~~~~~~~~~~
cat.cpp:26:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%lld %lld", &t1, &t2);
   ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Correct 8 ms 7416 KB Output is correct
3 Correct 8 ms 7416 KB Output is correct
4 Correct 8 ms 7416 KB Output is correct
5 Correct 587 ms 7928 KB Output is correct
6 Correct 684 ms 7832 KB Output is correct
7 Correct 440 ms 7960 KB Output is correct
8 Correct 707 ms 7928 KB Output is correct
9 Correct 502 ms 8156 KB Output is correct
10 Correct 685 ms 7928 KB Output is correct
11 Correct 519 ms 7928 KB Output is correct
12 Correct 519 ms 7928 KB Output is correct
13 Correct 618 ms 7928 KB Output is correct
14 Correct 732 ms 8056 KB Output is correct
15 Correct 9 ms 7416 KB Output is correct
16 Correct 8 ms 7416 KB Output is correct
17 Correct 8 ms 7416 KB Output is correct
18 Correct 8 ms 7416 KB Output is correct
19 Correct 6 ms 7416 KB Output is correct
20 Correct 409 ms 7928 KB Output is correct
21 Correct 1059 ms 8056 KB Output is correct
22 Correct 1040 ms 8008 KB Output is correct
23 Correct 220 ms 7928 KB Output is correct
24 Correct 219 ms 7836 KB Output is correct
25 Correct 8 ms 7416 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 255 ms 24504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 117 ms 18040 KB Output is correct
2 Correct 119 ms 21112 KB Output is correct
3 Correct 118 ms 21124 KB Output is correct
4 Correct 118 ms 21112 KB Output is correct
5 Correct 118 ms 20984 KB Output is correct
6 Correct 118 ms 20960 KB Output is correct
7 Correct 118 ms 20996 KB Output is correct
8 Correct 120 ms 21028 KB Output is correct
9 Correct 118 ms 21112 KB Output is correct
10 Correct 154 ms 24300 KB Output is correct
11 Correct 158 ms 24420 KB Output is correct
12 Correct 231 ms 24292 KB Output is correct
13 Correct 142 ms 24436 KB Output is correct
14 Correct 139 ms 24424 KB Output is correct
15 Correct 159 ms 24532 KB Output is correct
16 Correct 158 ms 24564 KB Output is correct
17 Correct 183 ms 24664 KB Output is correct
18 Correct 162 ms 24636 KB Output is correct
19 Correct 159 ms 24660 KB Output is correct

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Correct 8 ms 7416 KB Output is correct
3 Correct 8 ms 7416 KB Output is correct
4 Correct 8 ms 7416 KB Output is correct
5 Correct 587 ms 7928 KB Output is correct
6 Correct 684 ms 7832 KB Output is correct
7 Correct 440 ms 7960 KB Output is correct
8 Correct 707 ms 7928 KB Output is correct
9 Correct 502 ms 8156 KB Output is correct
10 Correct 685 ms 7928 KB Output is correct
11 Correct 519 ms 7928 KB Output is correct
12 Correct 519 ms 7928 KB Output is correct
13 Correct 618 ms 7928 KB Output is correct
14 Correct 732 ms 8056 KB Output is correct
15 Correct 9 ms 7416 KB Output is correct
16 Correct 8 ms 7416 KB Output is correct
17 Correct 8 ms 7416 KB Output is correct
18 Correct 8 ms 7416 KB Output is correct
19 Correct 6 ms 7416 KB Output is correct
20 Correct 409 ms 7928 KB Output is correct
21 Correct 1059 ms 8056 KB Output is correct
22 Correct 1040 ms 8008 KB Output is correct
23 Correct 220 ms 7928 KB Output is correct
24 Correct 219 ms 7836 KB Output is correct
25 Correct 8 ms 7416 KB Output is correct
26 Incorrect 255 ms 24504 KB Output isn't correct
27 Halted 0 ms 0 KB -