Submission #707091

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
707091	2023-03-08T12:31:26 Z	600Mihnea	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	36 / 100	1000 ms	912 KB

skyscraper

#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;
};

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);
		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 });
		}
	};

	relax(ofs[0].pos, 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 (int j = 0; j < cntofs; j++)
			{
				int posdif = abs(ofs[i].pos - ofs[j].pos);
				if (posdif % ofs[i].delta == 0)
				{
					relax(ofs[j].pos, dp[loc] + posdif / ofs[i].delta);
				}
			}
		}
	}
	for (int i = 0; i < dim; i++)
	{
		//cout << i << " ---> " << dp[i] << "\n";
	}
	int sol = (dp[ofs[1].pos] == INF) ? (-1) : (dp[ofs[1].pos]);
	cout << sol << "\n";
	return 0;
}

Subtask #1
10.0 / 10.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	1 ms	212 KB	Output is correct

Subtask #2
12.0 / 12.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	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	2 ms	384 KB	Output is correct
11	Correct	25 ms	364 KB	Output is correct
12	Correct	21 ms	340 KB	Output is correct
13	Correct	20 ms	356 KB	Output is correct
14	Correct	21 ms	340 KB	Output is correct
15	Correct	21 ms	340 KB	Output is correct

Subtask #3
14.0 / 14.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	0 ms	212 KB	Output is correct
4	Correct	1 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	1 ms	212 KB	Output is correct
10	Correct	2 ms	212 KB	Output is correct
11	Correct	24 ms	340 KB	Output is correct
12	Correct	20 ms	340 KB	Output is correct
13	Correct	20 ms	340 KB	Output is correct
14	Correct	21 ms	340 KB	Output is correct
15	Correct	23 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	16 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	24 ms	468 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	6 ms	408 KB	Output is correct
24	Correct	21 ms	340 KB	Output is correct
25	Correct	20 ms	444 KB	Output is correct
26	Correct	20 ms	340 KB	Output is correct
27	Correct	19 ms	408 KB	Output is correct
28	Correct	20 ms	340 KB	Output is correct
29	Correct	3 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	2 ms	340 KB	Output is correct
32	Correct	2 ms	340 KB	Output is correct
33	Correct	23 ms	340 KB	Output is correct
34	Correct	23 ms	460 KB	Output is correct

Subtask #4
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	1 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	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	21 ms	364 KB	Output is correct
12	Correct	20 ms	352 KB	Output is correct
13	Correct	19 ms	356 KB	Output is correct
14	Correct	21 ms	340 KB	Output is correct
15	Correct	21 ms	360 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	19 ms	340 KB	Output is correct
18	Correct	1 ms	340 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	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	5 ms	340 KB	Output is correct
24	Correct	18 ms	440 KB	Output is correct
25	Correct	20 ms	464 KB	Output is correct
26	Correct	21 ms	412 KB	Output is correct
27	Correct	20 ms	340 KB	Output is correct
28	Correct	22 ms	456 KB	Output is correct
29	Correct	3 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	2 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	22 ms	340 KB	Output is correct
34	Correct	21 ms	416 KB	Output is correct
35	Execution timed out	1089 ms	912 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-

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	280 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	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	2 ms	212 KB	Output is correct
11	Correct	22 ms	368 KB	Output is correct
12	Correct	20 ms	340 KB	Output is correct
13	Correct	20 ms	356 KB	Output is correct
14	Correct	21 ms	340 KB	Output is correct
15	Correct	20 ms	360 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	16 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	25 ms	480 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	5 ms	340 KB	Output is correct
24	Correct	20 ms	340 KB	Output is correct
25	Correct	22 ms	444 KB	Output is correct
26	Correct	22 ms	404 KB	Output is correct
27	Correct	22 ms	340 KB	Output is correct
28	Correct	20 ms	340 KB	Output is correct
29	Correct	3 ms	340 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	2 ms	340 KB	Output is correct
32	Correct	2 ms	468 KB	Output is correct
33	Correct	20 ms	340 KB	Output is correct
34	Correct	20 ms	340 KB	Output is correct
35	Execution timed out	1082 ms	804 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-

Submission #707091

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 0 / 21.0

Subtask #5 0 / 43.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
14.0 / 14.0

Subtask #4
0 / 21.0

Subtask #5
0 / 43.0