답안 #484289

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
484289	2021-11-02T21:47:39 Z	MilosMilutinovic	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	1000 ms	3360 KB

skyscraper

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=30100;
int n,m,b[N],p[N],d[N];
VI qs[N];
int main() {
	scanf("%d%d",&n,&m);
	rep(i,0,m) {
		scanf("%d%d",b+i,p+i);
		qs[b[i]].pb(p[i]);
	}
	rep(i,0,n) d[i]=(1<<29);
	priority_queue<pair<int,int>> q;
	q.push(mp(0,b[0])); d[b[0]]=0;
	while (SZ(q)) {
		auto x=q.top(); q.pop();
		if (d[x.se]<-x.fi) continue;
		for (int j:qs[x.se]) {
			for (int u=x.se-j;u>=0;u-=j) {
				if (d[u]>d[x.se]+(x.se-u)/j) {
					d[u]=d[x.se]+(x.se-u)/j;
					q.push(mp(-d[u],u));
				}
			}
			for (int u=x.se+j;u<n;u+=j) {
				if (d[u]>d[x.se]+(u-x.se)/j) {
					d[u]=d[x.se]+(u-x.se)/j;
					q.push(mp(-d[u],u));
				}
			}
		}
	}
	if (d[b[1]]==(1<<29)) printf("-1");
	else printf("%d",d[b[1]]);
}

Compilation message

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

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	972 KB	Output is correct
2	Correct	0 ms	972 KB	Output is correct
3	Correct	1 ms	972 KB	Output is correct
4	Correct	1 ms	972 KB	Output is correct
5	Correct	1 ms	972 KB	Output is correct
6	Correct	1 ms	972 KB	Output is correct
7	Correct	1 ms	972 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	972 KB	Output is correct
2	Correct	1 ms	972 KB	Output is correct
3	Correct	1 ms	972 KB	Output is correct
4	Correct	1 ms	972 KB	Output is correct
5	Correct	1 ms	972 KB	Output is correct
6	Correct	1 ms	972 KB	Output is correct
7	Correct	1 ms	972 KB	Output is correct
8	Correct	1 ms	972 KB	Output is correct
9	Correct	1 ms	972 KB	Output is correct
10	Correct	1 ms	972 KB	Output is correct
11	Correct	1 ms	972 KB	Output is correct
12	Correct	2 ms	1060 KB	Output is correct
13	Correct	2 ms	972 KB	Output is correct
14	Correct	2 ms	972 KB	Output is correct
15	Correct	2 ms	972 KB	Output is correct

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	972 KB	Output is correct
2	Correct	1 ms	972 KB	Output is correct
3	Correct	1 ms	972 KB	Output is correct
4	Correct	1 ms	972 KB	Output is correct
5	Correct	1 ms	972 KB	Output is correct
6	Correct	1 ms	972 KB	Output is correct
7	Correct	1 ms	972 KB	Output is correct
8	Correct	1 ms	972 KB	Output is correct
9	Correct	1 ms	972 KB	Output is correct
10	Correct	1 ms	1008 KB	Output is correct
11	Correct	1 ms	972 KB	Output is correct
12	Correct	2 ms	972 KB	Output is correct
13	Correct	2 ms	972 KB	Output is correct
14	Correct	1 ms	1020 KB	Output is correct
15	Correct	1 ms	1020 KB	Output is correct
16	Correct	1 ms	972 KB	Output is correct
17	Correct	1 ms	1100 KB	Output is correct
18	Correct	1 ms	972 KB	Output is correct
19	Correct	1 ms	972 KB	Output is correct
20	Correct	26 ms	1148 KB	Output is correct
21	Correct	1 ms	972 KB	Output is correct
22	Correct	1 ms	1060 KB	Output is correct
23	Correct	1 ms	972 KB	Output is correct
24	Correct	2 ms	1100 KB	Output is correct
25	Correct	2 ms	1100 KB	Output is correct
26	Correct	23 ms	1080 KB	Output is correct
27	Correct	21 ms	1084 KB	Output is correct
28	Correct	1 ms	1100 KB	Output is correct
29	Correct	2 ms	1100 KB	Output is correct
30	Correct	1 ms	1140 KB	Output is correct
31	Correct	2 ms	1100 KB	Output is correct
32	Correct	1 ms	1100 KB	Output is correct
33	Correct	2 ms	1100 KB	Output is correct
34	Correct	3 ms	1228 KB	Output is correct

Subtask #4
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	972 KB	Output is correct
2	Correct	1 ms	972 KB	Output is correct
3	Correct	1 ms	972 KB	Output is correct
4	Correct	1 ms	972 KB	Output is correct
5	Correct	1 ms	972 KB	Output is correct
6	Correct	1 ms	972 KB	Output is correct
7	Correct	1 ms	972 KB	Output is correct
8	Correct	1 ms	972 KB	Output is correct
9	Correct	1 ms	972 KB	Output is correct
10	Correct	1 ms	972 KB	Output is correct
11	Correct	1 ms	972 KB	Output is correct
12	Correct	2 ms	972 KB	Output is correct
13	Correct	2 ms	972 KB	Output is correct
14	Correct	1 ms	972 KB	Output is correct
15	Correct	1 ms	972 KB	Output is correct
16	Correct	1 ms	1020 KB	Output is correct
17	Correct	1 ms	972 KB	Output is correct
18	Correct	1 ms	1020 KB	Output is correct
19	Correct	1 ms	972 KB	Output is correct
20	Correct	26 ms	1148 KB	Output is correct
21	Correct	1 ms	972 KB	Output is correct
22	Correct	1 ms	972 KB	Output is correct
23	Correct	1 ms	1024 KB	Output is correct
24	Correct	2 ms	1100 KB	Output is correct
25	Correct	2 ms	1100 KB	Output is correct
26	Correct	23 ms	1084 KB	Output is correct
27	Correct	22 ms	972 KB	Output is correct
28	Correct	2 ms	1100 KB	Output is correct
29	Correct	2 ms	1144 KB	Output is correct
30	Correct	1 ms	1052 KB	Output is correct
31	Correct	1 ms	1100 KB	Output is correct
32	Correct	2 ms	1100 KB	Output is correct
33	Correct	2 ms	1100 KB	Output is correct
34	Correct	3 ms	1228 KB	Output is correct
35	Correct	7 ms	1612 KB	Output is correct
36	Correct	2 ms	1100 KB	Output is correct
37	Correct	7 ms	1568 KB	Output is correct
38	Correct	9 ms	1872 KB	Output is correct
39	Correct	8 ms	1796 KB	Output is correct
40	Correct	9 ms	1872 KB	Output is correct
41	Correct	9 ms	1788 KB	Output is correct
42	Correct	356 ms	1612 KB	Output is correct
43	Correct	369 ms	1612 KB	Output is correct
44	Correct	359 ms	1612 KB	Output is correct
45	Correct	9 ms	1672 KB	Output is correct
46	Correct	10 ms	1744 KB	Output is correct

Subtask #5
0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	972 KB	Output is correct
2	Correct	1 ms	972 KB	Output is correct
3	Correct	1 ms	972 KB	Output is correct
4	Correct	1 ms	972 KB	Output is correct
5	Correct	1 ms	972 KB	Output is correct
6	Correct	1 ms	972 KB	Output is correct
7	Correct	1 ms	972 KB	Output is correct
8	Correct	1 ms	972 KB	Output is correct
9	Correct	1 ms	972 KB	Output is correct
10	Correct	1 ms	972 KB	Output is correct
11	Correct	1 ms	972 KB	Output is correct
12	Correct	2 ms	972 KB	Output is correct
13	Correct	2 ms	972 KB	Output is correct
14	Correct	1 ms	1048 KB	Output is correct
15	Correct	1 ms	1024 KB	Output is correct
16	Correct	1 ms	972 KB	Output is correct
17	Correct	1 ms	1100 KB	Output is correct
18	Correct	1 ms	972 KB	Output is correct
19	Correct	1 ms	972 KB	Output is correct
20	Correct	26 ms	1100 KB	Output is correct
21	Correct	1 ms	972 KB	Output is correct
22	Correct	1 ms	972 KB	Output is correct
23	Correct	1 ms	972 KB	Output is correct
24	Correct	2 ms	1100 KB	Output is correct
25	Correct	2 ms	1100 KB	Output is correct
26	Correct	23 ms	1084 KB	Output is correct
27	Correct	22 ms	1084 KB	Output is correct
28	Correct	2 ms	1100 KB	Output is correct
29	Correct	2 ms	1100 KB	Output is correct
30	Correct	1 ms	1100 KB	Output is correct
31	Correct	2 ms	1100 KB	Output is correct
32	Correct	1 ms	1100 KB	Output is correct
33	Correct	2 ms	1100 KB	Output is correct
34	Correct	3 ms	1228 KB	Output is correct
35	Correct	7 ms	1612 KB	Output is correct
36	Correct	2 ms	1100 KB	Output is correct
37	Correct	7 ms	1552 KB	Output is correct
38	Correct	9 ms	1868 KB	Output is correct
39	Correct	9 ms	1736 KB	Output is correct
40	Correct	9 ms	1868 KB	Output is correct
41	Correct	9 ms	1792 KB	Output is correct
42	Correct	354 ms	1612 KB	Output is correct
43	Correct	358 ms	1612 KB	Output is correct
44	Correct	362 ms	1612 KB	Output is correct
45	Correct	11 ms	1740 KB	Output is correct
46	Correct	8 ms	1792 KB	Output is correct
47	Correct	18 ms	2380 KB	Output is correct
48	Correct	6 ms	1920 KB	Output is correct
49	Correct	6 ms	1868 KB	Output is correct
50	Correct	4 ms	1740 KB	Output is correct
51	Correct	24 ms	3360 KB	Output is correct
52	Correct	25 ms	2892 KB	Output is correct
53	Correct	13 ms	2872 KB	Output is correct
54	Correct	2 ms	1356 KB	Output is correct
55	Correct	3 ms	1356 KB	Output is correct
56	Execution timed out	1083 ms	2856 KB	Time limit exceeded
57	Halted	0 ms	0 KB	-

답안 #484289

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 21.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
21.0 / 21.0

Subtask #5
0 / 43.0