oj.uz

답안 #250015

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
250015 2020-07-16T16:32:38 Z Evirir Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 43108 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=(a);i<(b);i++)
#define fore(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define F first
#define S second
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef pair<ll,ii> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;
void amin(ll &a, ll b){ a=min(a,b); }
void amax(ll &a, ll b){ a=max(a,b); }
void YES(){cout<<"YES\n";} void NO(){cout<<"NO\n";}
void SD(int t=0){ cout<<"PASSED "<<t<<endl; }
const ll INF = ll(1e18);
const int MOD = 998244353;

const bool DEBUG = 0;
const int MAXN = 30005;
const int MAXP = 30005;
const int MAXM = 30005;
const int LIM = 150;

int n,m;
int a[MAXM],p[MAXM];
vi v[MAXN];
ll dist[MAXN][LIM];

priority_queue<iii,vector<iii>,greater<iii>> q;
void add(ll x, ll y, ll w, ll d)
{
	if(x<0 || x>=n) return;
	
	if(y>=LIM)
	{
		for(int i=x%y;i<n;i+=y){
			add(i, 0, abs(x-i)/y, d);
		}
	}
	else
	{
		if(dist[x][y]>d+w){
			dist[x][y]=d+w;
			q.push({dist[x][y],{x,y}});
		}
	}
}

void dijkstra(ii src)
{
	dist[src.F][src.S]=0;
	q.push({0,src});
	
	while(!q.empty())
	{
		ii u=q.top().S; q.pop();
		if(u.S)
		{
			add(u.F-u.S, u.S, 1, dist[u.F][u.S]);
			add(u.F+u.S, u.S, 1, dist[u.F][u.S]);
			add(u.F, 0, 0, dist[u.F][u.S]);
		}
		else
		{
			for(int P: v[u.F])
			{
				add(u.F, P, 0, dist[u.F][u.S]);
			}
		}
	}
}

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	
	cin>>n>>m;
	forn(i,0,m){
		cin>>a[i]>>p[i];
		v[a[i]].pb(p[i]);
	}
	
	forn(i,0,n) forn(j,0,LIM) dist[i][j]=INF;
	dijkstra({a[0],0});
	
	if(dist[a[1]][0]<INF) cout<<dist[a[1]][0]<<'\n';
	else cout<<-1<<'\n';
	
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 2 ms 1280 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 1 ms 1280 KB Output is correct
14 Correct 2 ms 1280 KB Output is correct
15 Correct 2 ms 1280 KB Output is correct
16 Correct 1 ms 1280 KB Output is correct
17 Correct 3 ms 2048 KB Output is correct
18 Correct 2 ms 3072 KB Output is correct
19 Correct 3 ms 3456 KB Output is correct
20 Correct 3 ms 3456 KB Output is correct
21 Correct 1 ms 1536 KB Output is correct
22 Correct 2 ms 3200 KB Output is correct
23 Correct 3 ms 2944 KB Output is correct
24 Correct 4 ms 3328 KB Output is correct
25 Correct 3 ms 3456 KB Output is correct
26 Correct 3 ms 3456 KB Output is correct
27 Correct 3 ms 3456 KB Output is correct
28 Correct 3 ms 3456 KB Output is correct
29 Correct 10 ms 3456 KB Output is correct
30 Correct 4 ms 3456 KB Output is correct
31 Correct 6 ms 3456 KB Output is correct
32 Correct 5 ms 3456 KB Output is correct
33 Correct 20 ms 3584 KB Output is correct
34 Correct 19 ms 3584 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1056 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 2 ms 1280 KB Output is correct
12 Correct 1 ms 1280 KB Output is correct
13 Correct 1 ms 1280 KB Output is correct
14 Correct 2 ms 1280 KB Output is correct
15 Correct 2 ms 1280 KB Output is correct
16 Correct 1 ms 1280 KB Output is correct
17 Correct 4 ms 2048 KB Output is correct
18 Correct 2 ms 3072 KB Output is correct
19 Correct 2 ms 3456 KB Output is correct
20 Correct 3 ms 3456 KB Output is correct
21 Correct 1 ms 1536 KB Output is correct
22 Correct 2 ms 3200 KB Output is correct
23 Correct 3 ms 2944 KB Output is correct
24 Correct 5 ms 3328 KB Output is correct
25 Correct 3 ms 3456 KB Output is correct
26 Correct 3 ms 3456 KB Output is correct
27 Correct 5 ms 3456 KB Output is correct
28 Correct 8 ms 3456 KB Output is correct
29 Correct 12 ms 3456 KB Output is correct
30 Correct 5 ms 3456 KB Output is correct
31 Correct 6 ms 3456 KB Output is correct
32 Correct 7 ms 3456 KB Output is correct
33 Correct 17 ms 3584 KB Output is correct
34 Correct 23 ms 3584 KB Output is correct
35 Correct 18 ms 3456 KB Output is correct
36 Correct 5 ms 2560 KB Output is correct
37 Correct 53 ms 4096 KB Output is correct
38 Correct 26 ms 4368 KB Output is correct
39 Correct 28 ms 4352 KB Output is correct
40 Correct 26 ms 4352 KB Output is correct
41 Correct 27 ms 4352 KB Output is correct
42 Correct 8 ms 3944 KB Output is correct
43 Correct 12 ms 3968 KB Output is correct
44 Correct 11 ms 3980 KB Output is correct
45 Correct 65 ms 4464 KB Output is correct
46 Correct 61 ms 4548 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 1024 KB Output is correct
6 Correct 1 ms 1024 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 2 ms 1280 KB Output is correct
12 Correct 1 ms 1280 KB Output is correct
13 Correct 1 ms 1280 KB Output is correct
14 Correct 2 ms 1280 KB Output is correct
15 Correct 2 ms 1280 KB Output is correct
16 Correct 1 ms 1280 KB Output is correct
17 Correct 4 ms 2048 KB Output is correct
18 Correct 4 ms 3200 KB Output is correct
19 Correct 2 ms 3456 KB Output is correct
20 Correct 3 ms 3456 KB Output is correct
21 Correct 1 ms 1536 KB Output is correct
22 Correct 3 ms 3200 KB Output is correct
23 Correct 6 ms 2944 KB Output is correct
24 Correct 8 ms 3328 KB Output is correct
25 Correct 3 ms 3456 KB Output is correct
26 Correct 3 ms 3456 KB Output is correct
27 Correct 3 ms 3456 KB Output is correct
28 Correct 4 ms 3456 KB Output is correct
29 Correct 9 ms 3456 KB Output is correct
30 Correct 5 ms 3456 KB Output is correct
31 Correct 6 ms 3456 KB Output is correct
32 Correct 5 ms 3456 KB Output is correct
33 Correct 18 ms 3584 KB Output is correct
34 Correct 18 ms 3584 KB Output is correct
35 Correct 16 ms 3456 KB Output is correct
36 Correct 6 ms 2560 KB Output is correct
37 Correct 31 ms 4096 KB Output is correct
38 Correct 29 ms 4352 KB Output is correct
39 Correct 26 ms 4352 KB Output is correct
40 Correct 23 ms 4352 KB Output is correct
41 Correct 25 ms 4352 KB Output is correct
42 Correct 8 ms 3968 KB Output is correct
43 Correct 7 ms 3968 KB Output is correct
44 Correct 8 ms 4004 KB Output is correct
45 Correct 58 ms 4548 KB Output is correct
46 Correct 68 ms 4548 KB Output is correct
47 Correct 112 ms 17020 KB Output is correct
48 Correct 21 ms 28928 KB Output is correct
49 Correct 21 ms 31488 KB Output is correct
50 Correct 20 ms 34304 KB Output is correct
51 Correct 75 ms 38004 KB Output is correct
52 Correct 90 ms 38040 KB Output is correct
53 Correct 36 ms 37112 KB Output is correct
54 Correct 30 ms 36224 KB Output is correct
55 Correct 22 ms 36224 KB Output is correct
56 Correct 32 ms 37372 KB Output is correct
57 Correct 119 ms 36372 KB Output is correct
58 Correct 32 ms 36864 KB Output is correct
59 Correct 37 ms 36864 KB Output is correct
60 Correct 47 ms 36856 KB Output is correct
61 Correct 39 ms 36864 KB Output is correct
62 Correct 83 ms 37376 KB Output is correct
63 Correct 94 ms 40176 KB Output is correct
64 Correct 108 ms 40044 KB Output is correct
65 Correct 316 ms 40180 KB Output is correct
66 Execution timed out 1032 ms 43108 KB Time limit exceeded
67 Halted 0 ms 0 KB -