oj.uz

Submission #58257

# Submission time Handle Problem Language Result Execution time Memory
58257 2018-07-17T09:53:35 Z memikakizaki Teleporters (IOI08_teleporters) C++14
65 / 100
 1000 ms 59188 KB 
#include <bits/stdc++.h>
#define long long long
using namespace std;
const int N = 1e6+1, INF = 1e9;

int n, m, lf[N], rg[N], nxt[N];
vector<int> vals, cycles;
bitset<N> mark;
long ans;
int main() {
	scanf("%d %d", &n, &m);
	vals.reserve(2*n+1);
	for(int i = 0; i < n; i++) {
		scanf("%d %d", &lf[i], &rg[i]);
		vals.push_back(lf[i]);
		vals.push_back(rg[i]);
	}
	vals.push_back(INF);
	stable_sort(vals.begin(), vals.end());
	for(int i = 0; i < n; i++) {
		lf[i] = lower_bound(vals.begin(), vals.end(), lf[i]) - vals.begin();
		rg[i] = lower_bound(vals.begin(), vals.end(), rg[i]) - vals.begin();
		nxt[lf[i]] = rg[i]+1;
		nxt[rg[i]] = lf[i]+1;
	}
	nxt[vals.size()-1] = INF;
	for(int i = 0; i < vals.size(); i++) if(!mark[i]) {
		int curr = i, sz = 0;
		bool cycle = false;
		while(curr != INF) {
			if(mark[curr]) {
				cycle = true;
				break;
			}
			++sz;
			mark[curr] = true;
			curr = nxt[curr];
		}
		if(cycle) cycles.push_back(sz);
		else ans = sz-1;
	}
	sort(cycles.begin(), cycles.end(), greater<int>());
	for(int i = 0; i < min((int) cycles.size(), m); i++) ans += cycles[i] + 2;
	if(m > cycles.size()) {
		m -= cycles.size();
		ans += (m - (m & 1)) << 1 + (m & 1);
	}
	printf("%lld", ans);
}

Compilation message

teleporters.cpp: In function 'int main()':
teleporters.cpp:27:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < vals.size(); i++) if(!mark[i]) {
                 ~~^~~~~~~~~~~~~
teleporters.cpp:44:7: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(m > cycles.size()) {
     ~~^~~~~~~~~~~~~~~
teleporters.cpp:46:29: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   ans += (m - (m & 1)) << 1 + (m & 1);
                           ~~^~~~~~~~~
teleporters.cpp:11: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:14:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &lf[i], &rg[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 424 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 480 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 532 KB Output isn't correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 612 KB Output isn't correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 616 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 620 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 624 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 628 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 764 KB Output is correct
2 Correct 12 ms 1052 KB Output is correct

Subtask #13
0 / 5.0

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

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1364 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 1640 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 6344 KB Output is correct
2 Correct 312 ms 15188 KB Output is correct

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 15968 KB Output is correct
2 Incorrect 551 ms 28300 KB Output isn't correct

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 742 ms 53360 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1053 ms 57564 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1067 ms 59188 KB Time limit exceeded
2 Halted 0 ms 0 KB -