oj.uz

Submission #118710

# Submission time Handle Problem Language Result Execution time Memory
118710 2019-06-19T13:22:48 Z eriksuenderhauf Teleporters (IOI08_teleporters) C++11
100 / 100
 487 ms 35020 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 2e6 + 5;
const double eps = 1e-9;
int nx[MAXN], vis[MAXN];

int main() {
	int n, m;
	scanf("%d %d", &n, &m);
	for (int i = 0 ; i < MAXN; i++)
		nx[i] = i + 1;
	vis[MAXN - 1] = 1;
	for (int i = 0; i < n; i++) {
		int u, v;
		scanf("%d %d", &u, &v);
		nx[u - 1] = v;
		nx[v - 1] = u;
	}
	int ans = -1;
	priority_queue<int> pq;
	for (int i = 0; i < MAXN; i++) {
		if (vis[i]) continue;
		int cur = i, cnt = 0;
		while (!vis[cur]) {
			vis[cur] = 1;
			if (nx[cur] != cur + 1)
				cnt++;
			cur = nx[cur];
		}
		if (ans == -1)
			ans = cnt;
		else
			pq.push(cnt);
	}
	while (!pq.empty() && m > 0) {
		m--;
		ans += pq.top() + 2;
		pq.pop();
	}
	ans += (m + 1) / 2 + (m / 2) * 3;
	pri(ans);
    return 0;
}

Compilation message

teleporters.cpp: In function 'int main()':
teleporters.cpp:41:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~
teleporters.cpp:47:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &u, &v);
   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 16044 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 16000 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 15992 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 16000 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 16000 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 16008 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 16000 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 15992 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 15968 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 16024 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 15964 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 16000 KB Output is correct
2 Correct 25 ms 15964 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 15980 KB Output is correct
2 Correct 26 ms 15992 KB Output is correct
3 Correct 30 ms 15992 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 16008 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 16056 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 16388 KB Output is correct
2 Correct 164 ms 20852 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 19572 KB Output is correct
2 Correct 250 ms 23300 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 314 ms 27364 KB Output is correct
2 Correct 348 ms 29180 KB Output is correct
3 Correct 357 ms 32104 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 434 ms 31212 KB Output is correct
2 Correct 435 ms 32168 KB Output is correct
3 Correct 383 ms 30456 KB Output is correct
4 Correct 377 ms 30712 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 474 ms 34920 KB Output is correct
2 Correct 487 ms 35020 KB Output is correct
3 Correct 266 ms 34660 KB Output is correct
4 Correct 387 ms 34936 KB Output is correct