oj.uz

Submission #369675

# Submission time Handle Problem Language Result Execution time Memory
369675 2021-02-22T08:04:03 Z Bill_00 Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 94272 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define pp push
#define MOD 1000000007
#define INF 1e18
#define N 30005
#define M 5000000
typedef long long ll;
const ll c=174;

using namespace std;
ll b[N],p[N],path[N];
vector<ll>pos[N];
unordered_map<ll,bool>pp[N];
vector<pair<ll,ll> >adj[N];
bool vis[N],visited[N];
int main(){
	// ios_base::sync_with_stdio(0);
	// cin.tie(0);
	// cout.tie(0)
	memset(path,-1,sizeof(path));
 	ll n,m;
 	cin >> n >> m;
 	for(ll i=1;i<=m;i++){
 		cin >> b[i] >> p[i];
 		if(pp[b[i]][p[i]]!=0){
 			vis[i]=1;
 		}
 		else{
 			pos[b[i]].pb(i);
 			pp[b[i]][p[i]]=1;
 		}
 	}
 	if(b[1]==b[2]){
 		cout << 0;
 		return 0;
 	}
 	for(ll i=1;i<=m;i++){
 		if(vis[i]==1) continue;
 		for(ll j=b[i];j<n;j+=p[i]){
 			bool flag=0;
 			for(ll k=0;k<pos[j].size();k++){
 				if(i==pos[j][k]) continue;
 				adj[i].pb({pos[j][k],(j-b[i])/p[i]});
 				if(p[i]==p[pos[j][k]]) flag=1;
 			}
 			if(flag==1) break;
 		}
 		for(ll j=b[i]-p[i];j>=0;j-=p[i]){
 			bool flag=0;
 			for(ll k=0;k<pos[j].size();k++){
 				adj[i].pb({pos[j][k],(b[i]-j)/p[i]});
 				if(p[i]==p[pos[j][k]]) flag=1;
 			}
 			if(flag==1) break;
 		}
 	}
 	priority_queue<pair<ll,ll> >pq;
 	pq.push({0,1});
 	while(!pq.empty()){
 		ll cost=-pq.top().ff;
 		ll doge_id=pq.top().ss;
 		// cout << doge_id <<" " << cost << '\n';
 		path[doge_id]=cost;
 		pq.pop();
 		visited[doge_id]=1;
 		for(pair<int,int>i:adj[doge_id]){
 			pq.push({-(cost+i.ss),i.ff});
 		}
 		while(!pq.empty() && visited[pq.top().ss]==1) pq.pop();
 	}
 	cout << path[2];
 
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:45:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for(ll k=0;k<pos[j].size();k++){
      |                ~^~~~~~~~~~~~~~
skyscraper.cpp:54:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for(ll k=0;k<pos[j].size();k++){
      |                ~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3564 KB Output is correct
2 Correct 3 ms 3564 KB Output is correct
3 Correct 3 ms 3564 KB Output is correct
4 Correct 3 ms 3564 KB Output is correct
5 Correct 3 ms 3564 KB Output is correct
6 Correct 3 ms 3564 KB Output is correct
7 Correct 3 ms 3564 KB Output is correct
8 Correct 3 ms 3564 KB Output is correct
9 Correct 3 ms 3692 KB Output is correct
10 Correct 6 ms 3948 KB Output is correct
11 Correct 29 ms 7268 KB Output is correct
12 Correct 4 ms 3692 KB Output is correct
13 Correct 4 ms 3692 KB Output is correct
14 Correct 27 ms 7652 KB Output is correct
15 Correct 27 ms 7656 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3564 KB Output is correct
2 Correct 3 ms 3564 KB Output is correct
3 Correct 3 ms 3564 KB Output is correct
4 Correct 3 ms 3564 KB Output is correct
5 Correct 3 ms 3564 KB Output is correct
6 Correct 3 ms 3564 KB Output is correct
7 Correct 3 ms 3712 KB Output is correct
8 Correct 3 ms 3564 KB Output is correct
9 Correct 3 ms 3692 KB Output is correct
10 Correct 4 ms 3948 KB Output is correct
11 Correct 24 ms 7268 KB Output is correct
12 Correct 4 ms 3692 KB Output is correct
13 Correct 4 ms 3692 KB Output is correct
14 Correct 28 ms 7652 KB Output is correct
15 Correct 33 ms 7656 KB Output is correct
16 Correct 4 ms 4096 KB Output is correct
17 Correct 12 ms 5232 KB Output is correct
18 Correct 4 ms 3820 KB Output is correct
19 Correct 3 ms 3692 KB Output is correct
20 Correct 5 ms 3948 KB Output is correct
21 Correct 4 ms 3820 KB Output is correct
22 Correct 3 ms 3692 KB Output is correct
23 Correct 4 ms 3820 KB Output is correct
24 Correct 7 ms 4332 KB Output is correct
25 Correct 8 ms 4076 KB Output is correct
26 Correct 4 ms 3692 KB Output is correct
27 Correct 7 ms 4588 KB Output is correct
28 Correct 6 ms 4460 KB Output is correct
29 Correct 7 ms 4332 KB Output is correct
30 Correct 3 ms 3692 KB Output is correct
31 Correct 4 ms 3948 KB Output is correct
32 Correct 4 ms 3820 KB Output is correct
33 Correct 28 ms 7652 KB Output is correct
34 Correct 28 ms 7656 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3564 KB Output is correct
2 Correct 3 ms 3564 KB Output is correct
3 Correct 3 ms 3564 KB Output is correct
4 Correct 3 ms 3564 KB Output is correct
5 Correct 3 ms 3672 KB Output is correct
6 Correct 3 ms 3564 KB Output is correct
7 Correct 4 ms 3564 KB Output is correct
8 Correct 3 ms 3564 KB Output is correct
9 Correct 3 ms 3692 KB Output is correct
10 Correct 4 ms 3948 KB Output is correct
11 Correct 24 ms 7268 KB Output is correct
12 Correct 4 ms 3692 KB Output is correct
13 Correct 4 ms 3692 KB Output is correct
14 Correct 27 ms 7652 KB Output is correct
15 Correct 27 ms 7656 KB Output is correct
16 Correct 4 ms 4076 KB Output is correct
17 Correct 12 ms 5232 KB Output is correct
18 Correct 4 ms 3820 KB Output is correct
19 Correct 4 ms 3692 KB Output is correct
20 Correct 5 ms 3948 KB Output is correct
21 Correct 4 ms 3948 KB Output is correct
22 Correct 4 ms 3712 KB Output is correct
23 Correct 4 ms 3820 KB Output is correct
24 Correct 7 ms 4332 KB Output is correct
25 Correct 7 ms 4204 KB Output is correct
26 Correct 4 ms 3692 KB Output is correct
27 Correct 9 ms 4604 KB Output is correct
28 Correct 6 ms 4460 KB Output is correct
29 Correct 7 ms 4332 KB Output is correct
30 Correct 3 ms 3692 KB Output is correct
31 Correct 5 ms 3948 KB Output is correct
32 Correct 5 ms 3820 KB Output is correct
33 Correct 29 ms 7652 KB Output is correct
34 Correct 27 ms 7656 KB Output is correct
35 Correct 968 ms 81008 KB Output is correct
36 Correct 24 ms 6884 KB Output is correct
37 Correct 957 ms 79448 KB Output is correct
38 Execution timed out 1096 ms 94272 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3564 KB Output is correct
2 Correct 3 ms 3564 KB Output is correct
3 Correct 3 ms 3564 KB Output is correct
4 Correct 3 ms 3564 KB Output is correct
5 Correct 3 ms 3564 KB Output is correct
6 Correct 4 ms 3564 KB Output is correct
7 Correct 4 ms 3564 KB Output is correct
8 Correct 3 ms 3564 KB Output is correct
9 Correct 3 ms 3564 KB Output is correct
10 Correct 4 ms 3948 KB Output is correct
11 Correct 24 ms 7268 KB Output is correct
12 Correct 4 ms 3692 KB Output is correct
13 Correct 4 ms 3692 KB Output is correct
14 Correct 29 ms 7652 KB Output is correct
15 Correct 28 ms 7656 KB Output is correct
16 Correct 4 ms 4076 KB Output is correct
17 Correct 12 ms 5356 KB Output is correct
18 Correct 5 ms 3824 KB Output is correct
19 Correct 5 ms 3692 KB Output is correct
20 Correct 5 ms 4096 KB Output is correct
21 Correct 4 ms 3820 KB Output is correct
22 Correct 4 ms 3820 KB Output is correct
23 Correct 5 ms 3840 KB Output is correct
24 Correct 83 ms 4332 KB Output is correct
25 Correct 6 ms 4076 KB Output is correct
26 Correct 4 ms 3692 KB Output is correct
27 Correct 8 ms 4588 KB Output is correct
28 Correct 7 ms 4460 KB Output is correct
29 Correct 7 ms 4332 KB Output is correct
30 Correct 4 ms 3692 KB Output is correct
31 Correct 230 ms 3844 KB Output is correct
32 Correct 4 ms 3852 KB Output is correct
33 Correct 28 ms 7652 KB Output is correct
34 Correct 65 ms 7656 KB Output is correct
35 Correct 940 ms 81100 KB Output is correct
36 Correct 24 ms 6884 KB Output is correct
37 Execution timed out 1014 ms 79448 KB Time limit exceeded
38 Halted 0 ms 0 KB -