oj.uz

Submission #249262

# Submission time Handle Problem Language Result Execution time Memory
249262 2020-07-14T14:34:01 Z hunni10 Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 25616 KB 
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<math.h>
#include<string.h>
#include<queue>
#include<list>
#include<time.h>
#include<assert.h>
#include<unordered_set>
#define MAX_DIVISOR 128
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
 
int n, m;
 
int b[30000];
int p[30000];
int shortest[30000];
vector<int> building_doge[30000];
vector<vector<int> > div_grid[MAX_DIVISOR+1];
bool visited[30000] = {0, };
bool inSorted[30000] = { 0, };
set<pii> sorted;
 
int main() {
	scanf("%d %d", &n, &m);
	for (int i = 0; i < m; i++) {
		scanf("%d %d", b + i, p + i);
		
	}
	for (int i = 0; i < m; i++) {
		shortest[i] = 0x7FFFFFFF;
	}
	for (int i = 1; i <= MAX_DIVISOR; i++) {
		div_grid[i].assign(i, {});
	}
	for (int i = 0; i < m; i++) {
		building_doge[b[i]].push_back(i);
		for (int divisor = 1; divisor <= MAX_DIVISOR; divisor++) {
			div_grid[divisor][b[i] % divisor].push_back(i);
		}
	}
	shortest[0] = 0;
	inSorted[0] = true;
	sorted.insert({ 0, 0 });
	while (true) {
		if (sorted.empty()) { printf("-1"); break; }
		pii now = *sorted.begin();
		if (now.second == 1) {
			printf("%d", now.first);
			break;
		}
		visited[now.second] = true;
		if (p[now.second] <= MAX_DIVISOR) {
			for (int v : div_grid[p[now.second]][b[now.second] % p[now.second]]) {
				if (visited[v]) continue;
				int times = (b[v] - b[now.second]) / p[now.second];
				if (times < 0) times = -times;
				times += now.first;
				if (times < shortest[v]) {
					if (inSorted[v]) {
						sorted.erase({ shortest[v], v });
					}
					shortest[v] = times;
					sorted.insert({ shortest[v], v });
					inSorted[v] = true;
				}
			}
		}
		int i = b[now.second] % p[now.second];
		for (; i < n; i+= p[now.second]) {
			for (int v : building_doge[i]) {
				if (visited[v]) continue;
				if ((i - b[now.second]) % p[now.second] == 0) {
					int times = (i - b[now.second]) / p[now.second];
					if (times < 0) times = -times;
					times += now.first;
					if (times < shortest[v]) {
						if (inSorted[v]) {
							sorted.erase({ shortest[v], v });
						}
						shortest[v] = times;
						sorted.insert({ shortest[v], v });
						inSorted[v] = true;
					}
				}
			}
		}
		sorted.erase(sorted.begin());
	}
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:35:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:37:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", b + i, p + i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 1 ms 1280 KB Output is correct
4 Correct 1 ms 1280 KB Output is correct
5 Correct 1 ms 1280 KB Output is correct
6 Correct 1 ms 1280 KB Output is correct
7 Correct 1 ms 1280 KB Output is correct
8 Correct 1 ms 1280 KB Output is correct
9 Correct 1 ms 1280 KB Output is correct
10 Correct 4 ms 1664 KB Output is correct
11 Correct 11 ms 2944 KB Output is correct
12 Correct 6 ms 2432 KB Output is correct
13 Correct 32 ms 2564 KB Output is correct
14 Correct 13 ms 2944 KB Output is correct
15 Correct 11 ms 2816 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 1 ms 1280 KB Output is correct
4 Correct 1 ms 1280 KB Output is correct
5 Correct 1 ms 1280 KB Output is correct
6 Correct 1 ms 1280 KB Output is correct
7 Correct 1 ms 1280 KB Output is correct
8 Correct 1 ms 1280 KB Output is correct
9 Correct 1 ms 1280 KB Output is correct
10 Correct 4 ms 1664 KB Output is correct
11 Correct 10 ms 2944 KB Output is correct
12 Correct 6 ms 2432 KB Output is correct
13 Correct 35 ms 2808 KB Output is correct
14 Correct 11 ms 2816 KB Output is correct
15 Correct 11 ms 2816 KB Output is correct
16 Correct 6 ms 2048 KB Output is correct
17 Correct 12 ms 2816 KB Output is correct
18 Correct 7 ms 2176 KB Output is correct
19 Correct 5 ms 1792 KB Output is correct
20 Correct 47 ms 3072 KB Output is correct
21 Correct 8 ms 2304 KB Output is correct
22 Correct 6 ms 1920 KB Output is correct
23 Correct 7 ms 2176 KB Output is correct
24 Correct 12 ms 2944 KB Output is correct
25 Correct 12 ms 2944 KB Output is correct
26 Correct 6 ms 2560 KB Output is correct
27 Correct 7 ms 2560 KB Output is correct
28 Correct 12 ms 3072 KB Output is correct
29 Correct 5 ms 1792 KB Output is correct
30 Correct 3 ms 1408 KB Output is correct
31 Correct 4 ms 1664 KB Output is correct
32 Correct 4 ms 1664 KB Output is correct
33 Correct 11 ms 2816 KB Output is correct
34 Correct 12 ms 2816 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 1 ms 1280 KB Output is correct
4 Correct 1 ms 1280 KB Output is correct
5 Correct 1 ms 1280 KB Output is correct
6 Correct 1 ms 1280 KB Output is correct
7 Correct 1 ms 1280 KB Output is correct
8 Correct 1 ms 1280 KB Output is correct
9 Correct 1 ms 1280 KB Output is correct
10 Correct 4 ms 1664 KB Output is correct
11 Correct 10 ms 2820 KB Output is correct
12 Correct 6 ms 2432 KB Output is correct
13 Correct 32 ms 2684 KB Output is correct
14 Correct 12 ms 2816 KB Output is correct
15 Correct 11 ms 2816 KB Output is correct
16 Correct 6 ms 2048 KB Output is correct
17 Correct 12 ms 2816 KB Output is correct
18 Correct 7 ms 2176 KB Output is correct
19 Correct 5 ms 1792 KB Output is correct
20 Correct 48 ms 3072 KB Output is correct
21 Correct 8 ms 2304 KB Output is correct
22 Correct 5 ms 1920 KB Output is correct
23 Correct 7 ms 2176 KB Output is correct
24 Correct 13 ms 2944 KB Output is correct
25 Correct 12 ms 2944 KB Output is correct
26 Correct 7 ms 2560 KB Output is correct
27 Correct 7 ms 2560 KB Output is correct
28 Correct 11 ms 3072 KB Output is correct
29 Correct 5 ms 1792 KB Output is correct
30 Correct 2 ms 1408 KB Output is correct
31 Correct 4 ms 1664 KB Output is correct
32 Correct 4 ms 1664 KB Output is correct
33 Correct 11 ms 2816 KB Output is correct
34 Correct 12 ms 2892 KB Output is correct
35 Correct 151 ms 21868 KB Output is correct
36 Correct 28 ms 5240 KB Output is correct
37 Correct 108 ms 17016 KB Output is correct
38 Correct 184 ms 25592 KB Output is correct
39 Correct 124 ms 25592 KB Output is correct
40 Correct 142 ms 25464 KB Output is correct
41 Correct 171 ms 25592 KB Output is correct
42 Correct 76 ms 18036 KB Output is correct
43 Correct 81 ms 19192 KB Output is correct
44 Execution timed out 1088 ms 19960 KB Time limit exceeded
45 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 1 ms 1280 KB Output is correct
4 Correct 1 ms 1280 KB Output is correct
5 Correct 1 ms 1280 KB Output is correct
6 Correct 1 ms 1280 KB Output is correct
7 Correct 1 ms 1280 KB Output is correct
8 Correct 1 ms 1280 KB Output is correct
9 Correct 1 ms 1280 KB Output is correct
10 Correct 4 ms 1664 KB Output is correct
11 Correct 10 ms 2888 KB Output is correct
12 Correct 6 ms 2432 KB Output is correct
13 Correct 32 ms 2680 KB Output is correct
14 Correct 11 ms 2816 KB Output is correct
15 Correct 12 ms 2816 KB Output is correct
16 Correct 6 ms 2048 KB Output is correct
17 Correct 12 ms 2816 KB Output is correct
18 Correct 7 ms 2176 KB Output is correct
19 Correct 5 ms 1792 KB Output is correct
20 Correct 46 ms 3096 KB Output is correct
21 Correct 8 ms 2304 KB Output is correct
22 Correct 6 ms 1920 KB Output is correct
23 Correct 7 ms 2176 KB Output is correct
24 Correct 12 ms 2944 KB Output is correct
25 Correct 12 ms 2944 KB Output is correct
26 Correct 7 ms 2560 KB Output is correct
27 Correct 7 ms 2560 KB Output is correct
28 Correct 12 ms 3072 KB Output is correct
29 Correct 5 ms 1792 KB Output is correct
30 Correct 2 ms 1408 KB Output is correct
31 Correct 4 ms 1664 KB Output is correct
32 Correct 4 ms 1664 KB Output is correct
33 Correct 12 ms 2816 KB Output is correct
34 Correct 12 ms 2816 KB Output is correct
35 Correct 147 ms 21880 KB Output is correct
36 Correct 23 ms 5240 KB Output is correct
37 Correct 105 ms 17016 KB Output is correct
38 Correct 171 ms 25592 KB Output is correct
39 Correct 118 ms 25616 KB Output is correct
40 Correct 130 ms 25492 KB Output is correct
41 Correct 171 ms 25592 KB Output is correct
42 Correct 75 ms 18036 KB Output is correct
43 Correct 83 ms 19192 KB Output is correct
44 Execution timed out 1090 ms 19960 KB Time limit exceeded
45 Halted 0 ms 0 KB -