oj.uz

Submission #132611

# Submission time Handle Problem Language Result Execution time Memory
132611 2019-07-19T08:33:10 Z sean617 None (KOI17_cat) C++
35 / 100
 1050 ms 26636 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], v2[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);
	}
}

void g(ll p, ll q) {
	ll i;
	if (v2[p]) {
		s += p;
		for (i = q; i != p; i = v2[i]) s += i;
		return;
	}
	v2[p] = q;
	for (i = 0; i < a[p].size(); i++) {
		if (a[p][i] == q) continue;
		g(a[p][i], p);
	}
	v2[p] = 0;
}
int main()
{
	ll i, j, t1, t2;
	cin >> n >> m;
	for (i = 1; i <= m; i++) {
		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;
	}
	if (n == m) {
		g(1, 0);
		cout << s + k;
		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 'void g(ll, ll)':
cat.cpp:30:16: 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:70:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (i = 0; i < k1.size(); i++) {
               ~~^~~~~~~~~~~
cat.cpp:75:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (cnt[i] == k1.size()) s += i;
        ~~~~~~~^~~~~~~~~~~~
cat.cpp:41: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

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 8 ms 7416 KB Output is correct
3 Correct 9 ms 7416 KB Output is correct
4 Correct 9 ms 7416 KB Output is correct
5 Correct 584 ms 8028 KB Output is correct
6 Correct 741 ms 7800 KB Output is correct
7 Correct 473 ms 7928 KB Output is correct
8 Correct 674 ms 7928 KB Output is correct
9 Correct 508 ms 8028 KB Output is correct
10 Correct 636 ms 7920 KB Output is correct
11 Correct 500 ms 8056 KB Output is correct
12 Correct 585 ms 8028 KB Output is correct
13 Correct 630 ms 7928 KB Output is correct
14 Correct 721 ms 8028 KB Output is correct
15 Correct 8 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 9 ms 7416 KB Output is correct
20 Correct 421 ms 8056 KB Output is correct
21 Correct 1047 ms 7932 KB Output is correct
22 Correct 1050 ms 8056 KB Output is correct
23 Correct 219 ms 7800 KB Output is correct
24 Correct 214 ms 7852 KB Output is correct
25 Correct 8 ms 7416 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 302 ms 26636 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 18104 KB Output is correct
2 Correct 120 ms 20252 KB Output is correct
3 Correct 120 ms 20336 KB Output is correct
4 Correct 122 ms 20332 KB Output is correct
5 Correct 119 ms 20520 KB Output is correct
6 Correct 119 ms 20480 KB Output is correct
7 Correct 119 ms 20436 KB Output is correct
8 Correct 119 ms 20604 KB Output is correct
9 Correct 119 ms 20472 KB Output is correct
10 Correct 140 ms 23908 KB Output is correct
11 Correct 142 ms 24036 KB Output is correct
12 Correct 140 ms 23844 KB Output is correct
13 Correct 142 ms 23960 KB Output is correct
14 Correct 155 ms 23968 KB Output is correct
15 Correct 172 ms 24164 KB Output is correct
16 Correct 161 ms 24148 KB Output is correct
17 Correct 159 ms 24152 KB Output is correct
18 Correct 177 ms 24144 KB Output is correct
19 Correct 162 ms 24316 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 8 ms 7416 KB Output is correct
3 Correct 9 ms 7416 KB Output is correct
4 Correct 9 ms 7416 KB Output is correct
5 Correct 584 ms 8028 KB Output is correct
6 Correct 741 ms 7800 KB Output is correct
7 Correct 473 ms 7928 KB Output is correct
8 Correct 674 ms 7928 KB Output is correct
9 Correct 508 ms 8028 KB Output is correct
10 Correct 636 ms 7920 KB Output is correct
11 Correct 500 ms 8056 KB Output is correct
12 Correct 585 ms 8028 KB Output is correct
13 Correct 630 ms 7928 KB Output is correct
14 Correct 721 ms 8028 KB Output is correct
15 Correct 8 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 9 ms 7416 KB Output is correct
20 Correct 421 ms 8056 KB Output is correct
21 Correct 1047 ms 7932 KB Output is correct
22 Correct 1050 ms 8056 KB Output is correct
23 Correct 219 ms 7800 KB Output is correct
24 Correct 214 ms 7852 KB Output is correct
25 Correct 8 ms 7416 KB Output is correct
26 Incorrect 302 ms 26636 KB Output isn't correct
27 Halted 0 ms 0 KB -