Submission #1120758

#	Time	Username	Problem	Language	Result	Execution time	Memory
1120758		mmdrzada	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	22 / 100	4 ms	3940 KiB

skyscraper

#include <bits/stdc++.h>
 
using namespace std;
 
typedef vector<int> vi;
typedef vector<char> vc;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
 
#define sep ' '
#define F first
#define S second
#define fastIO   ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define kill(x) {cout << x << endl;return;}
#define sz(x) int(x.size())
#define SP(x) setprecision(x) 
#define mod(x) (1ll*x%M+M)%M
#define pq priority_queue
#define mid (l+r)/2
// #define mid2 (l+r+1)/2
#define pll pair<ll, ll>
#define REP(i, k) for (int i = 0 ; i < k ; i ++)
#define MP make_pair
 
const int M = 998244353;
const int N = 3e4+1;
const int T = 175;
int n, m;
vector<pair<int, int>> adj[N];
ll dis[N];
bool vis[N];
int b[N], p[N];
vi D[N];

bitset<N> mat[N];
bitset<T> Y[N];


void solve() {
	// input in 0-index itself
	cin >> n >> m;
	for(int i = 0 ; i < m ; i ++) {
		cin >> b[i] >> p[i];
		D[b[i]].pb(p[i]);
	}
	for(int i = 0 ; i < n ; i ++) {
		sort(D[i].begin(), D[i].end(), greater<>());
	}
	for(int i = 0 ; i < n ; i ++) {
		for(int j = 0 ; j < D[i].size() && D[i][j] >= T; j ++) {
			if (j == 0 || D[i][j] != D[i][j-1]) {
				for(int k = i-D[i][j], cnt = 1 ; k >= 0 ; k -= D[i][j], cnt++) {
					if ((k == 1 || (!D[k].empty() && (D[k][0] > D[i][j] || D[k].back() < D[i][j]))) && !mat[i][k]) {
						adj[i].pb({k, cnt});
						mat[i][k] = true;
					}
				}
				for(int k = i+D[i][j], cnt = 1 ; k < n ; k += D[i][j], cnt++) {
					if ((k == 1 || (!D[k].empty() && (D[k][0] > D[i][j] || D[k].back() < D[i][j]))) && !mat[i][k]) {
						adj[i].pb({k, cnt});
						mat[i][k] = true;
					}
				}
			}
		}
		reverse(D[i].begin(), D[i].end());
	}
	fill(dis, dis+n, n*n+1);
	dis[b[0]] = 0;
	
	priority_queue<pii, vector<pii>, greater<pii> > q;
	q.push({0, b[0]});
	
	while(!q.empty()) {
		int u = q.top().S;
		q.pop();
		for(auto [neigh, w]: adj[u]) {
			if (dis[neigh] > dis[u] + w) {
				dis[neigh] = dis[u] + w;
				q.push({dis[neigh], neigh});
			}
		}
		for(int i = 0 ; i < D[u].size() && D[u][i] < T ; i ++) {
			int s = D[u][i];
			Y[u][s] = true;
			for(int k = u-s, w = 1 ; k >= 0 ; k -= s, w++) {
				// if (Y[k][s]) break;
				int neigh = k;
				if (dis[neigh] > dis[u] + w) {
					dis[neigh] = dis[u] + w;
					q.push({dis[neigh], neigh});
				}
			}
			for(int k = u+s, w = 1 ; k < n ; k += s, w++) {
				// if (Y[k][s]) break;
				int neigh = k;
				if (dis[neigh] > dis[u] + w) {
					dis[neigh] = dis[u] + w;
					q.push({dis[neigh], neigh});
				}
			}
		}
	}
	

	cout << (dis[b[1]] == n*n+1 ? -1 : dis[b[1]]) << endl;
}

// check MAXN
int32_t main() {
	fastIO;
	solve();
	
	return 0;
}

Compilation message (stderr)

skyscraper.cpp: In function 'void solve()':
skyscraper.cpp:53:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |   for(int j = 0 ; j < D[i].size() && D[i][j] >= T; j ++) {
      |                   ~~^~~~~~~~~~~~~
skyscraper.cpp:86:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |   for(int i = 0 ; i < D[u].size() && D[u][i] < T ; i ++) {
      |                   ~~^~~~~~~~~~~~~

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