oj.uz

Submission #110481

# Submission time Handle Problem Language Result Execution time Memory
110481 2019-05-10T22:01:41 Z MetB Teleporters (IOI08_teleporters) C++14
45 / 100
 708 ms 54268 KB 
#include <iostream>
#include <cstdlib>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <bitset>
#include <queue>
#include <math.h>
#include <stack>
#include <vector>
#include <string.h>
#include <random>
 
typedef long long ll;
 
const ll MOD = 1e9 + 7, INF = 1e18;
 
using namespace std;

int n, m, mn, ans;

pair <int, int> a[2000000];

int nxt[2000001], c[2000000], u[2000000], v[2000001];
int level[2000000], to[2000001];

int main ()
{
	cin >> n >> m;
	
	for (int i = 0; i < n; i++)
	{
		scanf ("%d%d", &a[i].first, &a[i].second);
		nxt[a[i].first - 1] = 2 * i + 1;
		nxt[a[i].second - 1] = 2 * i + 2;

		if (a[mn].first > a[i].first) mn = i;
	}

	for (int i = 2000000 - 1; i >= 0; i--)
		if (!nxt[i]) nxt[i] = nxt[i + 1];

	to[0] = 2 * mn + 1;

	for (int i = 0; i < n; i++)
	{
		to[2 * i + 1] = nxt[a[i].second];
		to[2 * i + 2] = nxt[a[i].first];
	}

	int color = 1;

	for (int i = 0; i < 2 * n + 1; i++)
	{
		int x = i;
		u[x] = color;

		while (!u[to[x]])
		{
			level[to[x]] = level[x] + 1;
			u[to[x]] = color;
			x = to[x];
		}

		if (u[to[x]] == color)
		{
			if (color == 1) ans = level[x] - level[to[x]];
			else v[level[x] - level[to[x]] + 1]++;
		}
		color++;
	}

	for (int i = 2 * n; i >= 1 && m; i--)
		while (v[i])
		{
			m--;
			v[i]--;
			ans += i + 2;
		}

	cout << ans + m / 2 * 4 + m % 2;
}

Compilation message

teleporters.cpp: In function 'int main()':
teleporters.cpp:34:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%d%d", &a[i].first, &a[i].second);
   ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 8192 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 8192 KB Output is correct

Subtask #3
0 / 5.0

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

Subtask #4
0 / 5.0

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

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 8192 KB Output is correct

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 8164 KB Output is correct

Subtask #8
0 / 5.0

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

Subtask #9
0 / 5.0

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

Subtask #10
0 / 5.0

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

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 8244 KB Output is correct

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 8244 KB Output is correct
2 Incorrect 18 ms 8588 KB Output isn't correct

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 8340 KB Output is correct
2 Incorrect 17 ms 8696 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 8576 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 8704 KB Output is correct

Subtask #16
0 / 5.0

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

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 14808 KB Output is correct
2 Correct 338 ms 28676 KB Output is correct

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 434 ms 27724 KB Output is correct
2 Incorrect 528 ms 42732 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 633 ms 35712 KB Output is correct
2 Incorrect 588 ms 51832 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 708 ms 39672 KB Output is correct
2 Incorrect 643 ms 54268 KB Output isn't correct
3 Halted 0 ms 0 KB -