oj.uz

Submission #678461

# Submission time Handle Problem Language Result Execution time Memory
678461 2023-01-06T03:57:54 Z penguin133 Jakarta Skyscrapers (APIO15_skyscraper) C++17
0 / 100
 15 ms 22356 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
 
int n, m;
int S[30005], P[30005];
int dist[30005];
vector<int> pos[30005];
vector<pi> stuf[205][205];
bool vis[300005];
queue<int> q[30005];
void solve(){
	cin >> n >> m;
	for(int i=0;i<m;i++){
		cin >> S[i] >> P[i];
		if(P[i] <= 200){
			for(int j=P[i];j<=200;j++){
				stuf[j][S[i]%j].push_back({S[i], i});
			}
		}
	}
	for(int i=1;i<=200;i++)for(int j=0;j<i;j++)sort(stuf[i][j].begin(), stuf[i][j].end());
	for(int i=0;i<m;i++)dist[i] = 1e9;
	
	dist[0] = 0;
	q[0].push(0);
	bool f = 0;
	for(int i=0;i<30000;i++){
		while(!q[i].empty()){
			int j = q[i].front(); q[i].pop();
			if(dist[j] < i)continue;
			if(j == 1){
				f = 1;
				break;
			}
			for(auto x : pos[S[j]]){
				if(dist[x] > i){
					dist[x] = i;
					if(P[x] != P[j])q[i].push(x);
				}
			}
			pos[S[j]].clear();
			if(P[j] > 200){
				for(int a=S[j] + P[j];a<n;a+=P[j]){
					if(i + abs(S[j] - a) / P[j] > 30000)break;
					for(auto x : pos[a]){			
						if(dist[x] <= dist[j] + abs(S[j] - S[x]) / P[j])break;
						dist[x] = i + abs(S[j] - S[x]) / P[j];
						if(dist[x] > 30000)continue;
						if(P[x] != P[j])q[dist[x]].push(x);
						break;
					}
				}
				for(int a=S[j] - P[j]; a >= 0; a-= P[j]){
				  if(i + abs(S[j] - a) / P[j] > 30000)break;
					for(auto x : pos[a]){			
						if(dist[x] <= dist[j] + abs(S[j] - S[x]) / P[j])break;
						dist[x] = i + abs(S[j] - S[x]) / P[j];
						if(dist[x] > 30000)continue;
						if(P[x] != P[j])q[dist[x]].push(x);
						break;
					}
				}
			}
			else{
				for(int a=P[j];a<=P[j];a++){
					int x = upper_bound(stuf[a][S[j]%a].begin(), stuf[a][S[j]%a].end(), make_pair(S[j], (int)1e9)) - stuf[a][S[j]%a].begin();
					if(x < (int)stuf[a][S[j]%a].size()){
						//cerr << a << " " << S[j] << " " << stuf[a][S[j]%a][x].fi << '\n';
						if(dist[stuf[a][S[j]%a][x].se] > i + abs(S[j] - stuf[a][S[j]%a][x].fi) / P[j]){
							dist[stuf[a][S[j]%a][x].se] = i + abs(S[j] - stuf[a][S[j]%a][x].fi) / P[j], q[dist[stuf[a][S[j]%a][x].se]].push(stuf[a][S[j]%a][x].se);
						}
					}
					if(x > 0){
						x--;
						while(x >= 0 && stuf[a][S[j]%a][x].fi == S[j])x--;
						if(x < 0)continue;
						if(dist[stuf[a][S[j]%a][x].se] > i + abs(S[j] - stuf[a][S[j]%a][x].fi) / P[j]){
							dist[stuf[a][S[j]%a][x].se] = i + abs(S[j] - stuf[a][S[j]%a][x].fi) / P[j], q[dist[stuf[a][S[j]%a][x].se]].push(stuf[a][S[j]%a][x].se);
						}
					}
				}
			}
		}
		if(f)break;
	}
	cout << (dist[1] == 1e9 ? -1 : dist[1]);
}
 
main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

skyscraper.cpp:98:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   98 | main(){
      | ^~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 22356 KB Output is correct
2 Incorrect 15 ms 22144 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 22180 KB Output is correct
2 Incorrect 14 ms 22224 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 22228 KB Output is correct
2 Incorrect 14 ms 22220 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 22228 KB Output is correct
2 Incorrect 13 ms 22228 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 22228 KB Output is correct
2 Incorrect 14 ms 22228 KB Output isn't correct
3 Halted 0 ms 0 KB -