oj.uz

Submission #707096

# Submission time Handle Problem Language Result Execution time Memory
707096 2023-03-08T12:47:44 Z 600Mihnea Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 7672 KB 
#include <cmath>
#include <functional>
#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <cassert>
#include <bitset>
#include <sstream>
#include <chrono>
#include <cstring>
#include <numeric>

using namespace std;

const int INF = (int)1e9 + 7;

struct T
{
	int pos;
	int delta;
};

bool operator < (T a, T b)
{
	return make_pair(a.pos, a.delta) < make_pair(b.pos, b.delta);
}

signed main()
{
#ifdef ONPC	
	FILE* stream;
	freopen_s(&stream, "input.txt", "r", stdin);
#else
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#endif

	int dim, cntofs;
	cin >> dim >> cntofs;

	vector<T> ofs(cntofs);
	vector<vector<int>> cine(dim);
	for (int i = 0; i < cntofs; i++)
	{
		cin >> ofs[i].pos >> ofs[i].delta;
		assert(0 <= ofs[i].pos && ofs[i].pos < dim);
	}
	int Init = ofs[0].pos;
	int Query = ofs[1].pos;

	sort(ofs.begin(), ofs.end());

	{
		assert(!ofs.empty());
		vector<T> newofs = { ofs[0] };
		for (int i = 1; i < cntofs; i++)
		{
			if (make_pair(ofs[i].pos, ofs[i].delta) != make_pair(ofs[i - 1].pos, ofs[i - 1].delta))
			{
				newofs.push_back(ofs[i]);
			}
		}
		ofs = newofs;
		cntofs = (int)ofs.size();
	}

	assert((int)ofs.size() == cntofs);

	for (int i = 0; i < cntofs; i++)
	{
		assert(0 <= ofs[i].pos && ofs[i].pos < dim);
		cine[ofs[i].pos].push_back(i);
	}

	
	vector<int> dp(dim, INF);

	priority_queue<pair<int, int>> pq;

	auto relax = [&](int i, int val)
	{
		if (val < dp[i])
		{
			dp[i] = val;
			pq.push({ -dp[i], i });
		}
	};

	set<pair<int, int>> s_delta_rest;
	// {delta, rest}
	for (auto& it : ofs)
	{
		s_delta_rest.insert({ it.delta, it.pos % it.delta });
	}
	vector<pair<int, int>> v_delta_rest;

	for (auto& it : s_delta_rest)
	{
		v_delta_rest.push_back(it);
	}

	int states = (int)v_delta_rest.size();
	vector<vector<int>> cool(states);
	for (int it = 0; it < states; it++)
	{
		int i = v_delta_rest[it].first, j = v_delta_rest[it].second;
		for (int p = j; p < dim; p += i)
		{
			if (!cine[p].empty())
			{
				cool[it].push_back(p);
			}
		}
	}

	auto fnd = [&](pair<int, int> it)
	{
		assert(0 <= it.second && it.second < it.first);
		int l = 0, r = (int)v_delta_rest.size() - 1;
		while (l <= r)
		{
			int m = (l + r) / 2;
			if (v_delta_rest[m] == it)
			{
				return m;
			}
			if (v_delta_rest[m] < it)
			{
				l = m + 1;
			}
			else
			{
				r = m - 1;
			}
		}
		assert(0);
	};

	relax(Init, 0);
	
	while (!pq.empty())
	{
		auto it = pq.top();
		pq.pop();
		int loc = it.second;
		if (-it.first != dp[loc])
		{
			continue;
		}
		for (auto& i : cine[loc])
		{
			for (auto& loc2 : cool[fnd({ ofs[i].delta, loc % ofs[i].delta })])
			{
				int posdif = abs(ofs[i].pos - loc2);
				relax(loc2, dp[loc] + posdif / ofs[i].delta);
			}
		}
	}
	int sol = (dp[Query] == INF) ? (-1) : (dp[Query]);
	cout << sol << "\n";
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 644 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 372 KB Output is correct
20 Correct 24 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 724 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 2 ms 596 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 24 ms 488 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 724 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 20 ms 3800 KB Output is correct
36 Correct 4 ms 980 KB Output is correct
37 Correct 17 ms 3432 KB Output is correct
38 Correct 25 ms 4680 KB Output is correct
39 Correct 25 ms 4576 KB Output is correct
40 Correct 26 ms 4580 KB Output is correct
41 Correct 25 ms 4564 KB Output is correct
42 Correct 4 ms 596 KB Output is correct
43 Correct 4 ms 596 KB Output is correct
44 Correct 28 ms 596 KB Output is correct
45 Correct 18 ms 4124 KB Output is correct
46 Correct 18 ms 4156 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 26 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 724 KB Output is correct
29 Correct 1 ms 472 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 372 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 596 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 21 ms 3880 KB Output is correct
36 Correct 4 ms 980 KB Output is correct
37 Correct 17 ms 3384 KB Output is correct
38 Correct 25 ms 4588 KB Output is correct
39 Correct 30 ms 4724 KB Output is correct
40 Correct 26 ms 4580 KB Output is correct
41 Correct 26 ms 4588 KB Output is correct
42 Correct 5 ms 624 KB Output is correct
43 Correct 5 ms 596 KB Output is correct
44 Correct 28 ms 596 KB Output is correct
45 Correct 18 ms 4048 KB Output is correct
46 Correct 20 ms 4088 KB Output is correct
47 Correct 37 ms 7672 KB Output is correct
48 Correct 17 ms 4572 KB Output is correct
49 Correct 18 ms 4256 KB Output is correct
50 Correct 12 ms 3424 KB Output is correct
51 Correct 44 ms 6840 KB Output is correct
52 Correct 39 ms 6996 KB Output is correct
53 Correct 27 ms 5844 KB Output is correct
54 Correct 1 ms 1108 KB Output is correct
55 Correct 1 ms 1108 KB Output is correct
56 Execution timed out 1095 ms 2924 KB Time limit exceeded
57 Halted 0 ms 0 KB -