Submission #1247608

#	Time	Username	Problem	Language	Result	Execution time	Memory
1247608		thdh__	Passport (JOI23_passport)	C++20	100 / 100	962 ms	150976 KiB

passport

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define eb emplace_back
#define pu push
#define ins insert
#define fi first
#define se second
#define all(a) a.begin(),a.end()
#define bruh ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define fu(x,a,b) for (auto x=a;x<=b;x++)
#define fd(x,a,b) for (auto x=a;x>=b;x--)
#define int ll

using namespace std;
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());

/*
Competitive Programming notes that I need to study & fix my dumbass self:

1. Coding:
- Always be sure to check the memory of arrays (maybe use vectors), for loops
- Always try to maximize the memory if possible, even if you are going for subtasks
- Do not exploit #define int long long, it will kill you

2. Stress: 
- Always try generating big testcases and try if they run

3. Time management:
- Don't overcommit or undercommit, always spend a certain amount of time to think a problem, don't just look at it and say I'm fucked
- Do not spend too much time coding brute-force solutions, they should be easily-codable solutions that don't take up too much time

Time management schedule:
Offline / LAH days (4 problems - 3h):
15' thinking of solution / idea
1. no idea: skip
2. yes idea: continue thinking for <= 15'

+ implementing: <= 20'
+ brute-force: <= 5'
+ test generator: <= 5'

I hate offline because I am dumb
*/

typedef pair<int, int> ii;
const int N = 2e5+5;
const int M = 2e6+5;
const int B = 750;
const int mod = 1e9+7;
const int inf = 1e18;
using cd = complex<double>;
const long double PI = acos(-1);
int power(int a,int b) {ll x = 1;if (a >= mod) a%=mod; while (b) {if (b & 1) x = x*a % mod;a = a*a % mod;b>>=1;}return x;} 

int n, q, mx = 0;
int st[4*N];
vector<ii> adj[M];
int d[M];
priority_queue<ii, vector<ii>, greater<ii>> pq;
int d1[M], dn[M], a[N];

void add_edge(int v, int u, int w) 
{
	mx = max({mx, u, v});
	// cout<<u<<" "<<v<<" "<<w<<endl;
	adj[u].pb({v,w});
}

void build(int id, int l, int r) 
{
	if (l == r) 
	{
		add_edge(id+n, l, 1);
		return;
	}
	int mid = l+r>>1;
	build(id*2, l, mid); build(id*2+1, mid+1, r);
	add_edge(id+n, id*2+n, 0), add_edge(id+n, id*2+1+n, 0);
}

void update(int id, int l, int r, int u, int v, int i) 
{
	if (l > v || r < u) return;
	if (u <= l && r <= v) 
	{
		add_edge(i, id+n, 0);
		return;
	}
	int mid = l+r>>1;
	update(id*2, l, mid, u, v, i); update(id*2+1, mid+1, r, u, v, i);
}

void dijkstra() 
{
	while (!pq.empty()) 
	{
		int dist = pq.top().fi, u = pq.top().se;
		pq.pop();
		if (dist != d[u]) continue;
		for (auto i : adj[u]) 
		{
			int v = i.fi, w = i.se;
			if (dist + w < d[v]) 
			{
				d[v] = dist+w;
				pq.push({d[v], v});
			}
		}
	}
}

void solve()
{
	cin>>n;
	build(1,1,n);
	for (int i = 1; i <= n; i++) 
	{
		int l,r; cin>>l>>r;
		update(1,1,n,l,r,i);
	}
	fill(d, d+mx+1, inf);
	d[1] = 0; pq.push({d[1], 1});
	dijkstra();
	for (int i = 1; i <= n; i++) d1[i] = d[i];
	// for (int i = 1; i <= n; i++) cout<<d[i]<<" ";
	// cout<<endl;
	fill(d, d+mx+1, inf);
	d[n] = 0; pq.push({d[n], n});
	dijkstra();
	for (int i = 1; i <= n; i++) dn[i] = d[i];
	// for (int i = 1; i <= n; i++) cout<<d[i]<<" ";
	// cout<<endl;
	for (int i = 1; i <= n; i++) a[i] = (d1[i] + dn[i]) - (i != 1 && i != n);
	// for (int i = 1; i <= n; i++) cout<<a[i]<<" ";
	// cout<<endl;
	fill(d, d+mx+1, inf);
	for (int i = 1; i <= n; i++) pq.push({a[i], i}), d[i] = a[i];
	dijkstra();
	cin>>q;
	while (q--) 
	{
		int x; cin>>x;
		if (d[x] >= inf) 
		{
			cout<<-1<<endl;
		} else cout<<d[x]<<endl;
	}
}

/*
Go through the mistakes you usually make and revise your code, for god's sake...
*/

signed main()
{
	bruh
	//freopen("input.inp","r",stdin);
	//freopen("output.inp","w",stdout);
	int t = 1;
	// cin>>t;
	while (t--)
	{
		solve();
		cout<<"\n";
	}
}

• Subtask 1: 6 / 6
• Subtask 2: 16 / 16
• Subtask 3: 24 / 24
• Subtask 4: 8 / 8
• Subtask 5: 46 / 46