Submission #676080

#	Time	Username	Problem	Language	Result	Execution time	Memory
676080		Keshi	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	1085 ms	70768 KiB

skyscraper

//In the name of God
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3")

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll maxn = 3e4 + 100;
const ll mod = 1e9 + 7;
const ll inf = 1e18;

#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define pb push_back
#define Mp make_pair
#define F first
#define S second
#define Sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()

ll pw(ll a, ll b){
	ll c = 1;
	while(b){
		if(b & 1) c = c * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return c;
}

map<int, bool> vis[maxn];

int n, m, start, goal, dis;

bool vs[maxn];

bool siv[256][maxn];

vector<int> vec[maxn];
vector<int> q, qu;

void add(int v){
	if(0 > v || v >= m || vs[v]) return;
	vs[v] = 1;
	if(v == goal){
		cout << dis;
		exit(0);
	}
	for(int x : vec[v]){
		if(x < 250) siv[x][v] = 1;
		else vis[x][v] = 1;
		q.pb((x << 15) | v);
	}
	return;
}

int main(){
	fast_io;
	q.reserve(1000000);
	qu.reserve(1000000);
	
	cin >> m >> n;
	
	for(int i = 0; i < n; i++){
		int v, x;
		cin >> v >> x;
		if(i == 0) start = v;
		if(i == 1) goal = v;
		vec[v].pb(x);
	}
	add(start);
	int cnt = 0;
	
	while(!q.empty()){
		dis++;
		qu = q;
		q.clear();
		cnt += Sz(qu);
		assert(cnt < 7500000);
		for(int i : qu){
			int x = (i >> 15);
			int v = (i ^ (x << 15));
			add(v - x);
			add(v + x);
			if(v + x < m && !(x < 250 ? siv[x][v + x] : vis[x][v + x])){
				if(x < 250) siv[x][v + x] = 1;
				else vis[x][v + x] = 1;
				q.pb((x << 15) | (v + x));
			}
			if(0 < v - x && !(x < 250 ? siv[x][v - x] : vis[x][v - x])){
				if(x < 250) siv[x][v - x] = 1;
				else vis[x][v - x] = 1;
				q.pb((x << 15) | (v - x));	
			}
		}
	}
	cout << -1;
	
	return 0;
}

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