제출 #1239989

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1239989		thelegendary08	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	22 / 100	1098 ms	73020 KiB

skyscraper

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<endl
#define dout(a) cout<<a<<' '<<#a<<endl
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<endl
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
 
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in2(n,m);
	vi b(m), p(m); 
	f0r(i, m){
		cin>>b[i]>>p[i];
	}
	vvi doges(n);
	f0r(i,m){
		// for(int j = b[i]; j < n; j += p[i]){
			// doges[j].pb(i);
		// }
		// for(int j = b[i] - p[i]; j >= 0; j -= p[i]){
			// doges[j].pb(i);
		// }
		doges[b[i]].pb(i);
	}
	vvi dist(n, vi(m, 4e18));
	dist[b[0]][0] = 0;
	priority_queue<vi> q;
	q.push({0,b[0],0});
	while(!q.empty()){
		int loc = q.top()[1]; int doge = q.top()[2]; q.pop();
		// dout2(loc, doge);
		for(auto u : doges[loc]){
			if(u != doge){
				// int nxt = abs(b[u] - loc) / p[u];
				if(dist[loc][doge] < dist[loc][u]){
					dist[loc][u] = dist[loc][doge];
					q.push({-dist[loc][u], loc, u});
				}
			}
		}
		int cnt = 1;
		for(int j = loc + p[doge]; j < n; j += p[doge]){
			if(cnt + dist[loc][doge] < dist[j][doge]){
				dist[j][doge] = cnt + dist[loc][doge];
				q.push({-dist[j][doge], j, doge});
			}
			cnt++;
		}
		cnt = 1;
		for(int j = loc - p[doge]; j >=0; j-= p[doge]){
			if(cnt + dist[loc][doge] < dist[j][doge]){
				dist[j][doge] = cnt + dist[loc][doge];
				q.push({-dist[j][doge], j, doge});
			}
			cnt++;
		}
		
	}
	// f0r(i,n){
		// f0r(j, m){
			// cout<<dist[i][j]<<' ';
		// }
		// cout<<'\n';
	// }
	int ans = 4e18;
	f0r(i,n){
		ans = min(ans, dist[i][1]);
	}
	if(ans == 4e18)out(-1);
	else out(ans);
}

• Subtask 1: 10 / 10
• Subtask 2: 12 / 12
• Subtask 3: 0 / 14
• Subtask 4: 0 / 21
• Subtask 5: 0 / 43