oj.uz

Submission #969802

# Submission time Handle Problem Language Result Execution time Memory
969802 2024-04-25T15:48:33 Z pcc Jakarta Skyscrapers (APIO15_skyscraper) C++17
22 / 100
 67 ms 133204 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC target("avx2,popcnt,sse4")
#pragma GCC optimize("O3,unroll-loops")
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>


const int inf = 1e9;
const int mxn = 3e4+10;
const int mxe = mxn*sqrt(mxn)*3;
const int mxv = mxe;

map<pii,vector<int>> mp;
int N,M;
int ecnt,vcnt;
int to[mxe],nid[mxe];
bitset<mxn> wei;
int head[mxv];
int dist[mxv];
int S,T;

void add_edge(int a,int b,int w){
	ecnt++;
	nid[ecnt] = head[a];
	to[ecnt] = b;
	wei[ecnt] = w;
	head[a] = ecnt;
}

deque<pii> dq;
void BFS(){
	fill(dist,dist+mxv,inf);
	dist[S] = 0;
	dq.push_back(pii(0,S));
	while(!dq.empty()){
		auto [d,now] = dq.front();
		dq.pop_front();
		if(d != dist[now])continue;
		for(int eid = head[now];eid;eid = nid[eid]){
			int nxt = to[eid],w = wei[eid];
			//cout<<now<<' '<<nxt<<":"<<dist[now]+w<<' '<<dist[nxt]<<endl;
			if(!w){
				if(dist[nxt]>dist[now]){
					dist[nxt] = dist[now];
					dq.push_front(pii(dist[nxt],nxt));
				}
			}
			else{
				if(dist[nxt]>dist[now]+w){
					dist[nxt] = dist[now]+w;
					dq.push_back(pii(dist[nxt],nxt));
				}
			}
		}
	}
	return;
}


int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>N>>M;
	for(int i = 0;i<M;i++){
		pii tmp;
		cin>>tmp.fs>>tmp.sc;
		mp[pii(tmp.sc,tmp.fs%tmp.sc)].push_back(tmp.fs);
		if(!i)S = tmp.fs;
		if(i == 1)T = tmp.fs;
	}
	vcnt = N-1;
	for(auto &i:mp){
		sort(i.sc.rbegin(),i.sc.rend());
		for(int j = i.fs.sc;j<N;j+=i.fs.fs){
			vcnt++;
			add_edge(vcnt,j,0);
			while(!i.sc.empty()&&i.sc.back() == j){
				add_edge(i.sc.back(),vcnt,0);
				i.sc.pop_back();
			}
			if(j != i.fs.sc){
				add_edge(vcnt-1,vcnt,1);
				add_edge(vcnt,vcnt-1,1);
			}
		}
	}
	BFS();
	cout<<(dist[T]>=inf?-1:dist[T])<<'\n';
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 65368 KB Output is correct
2 Correct 9 ms 65372 KB Output is correct
3 Correct 9 ms 65500 KB Output is correct
4 Correct 8 ms 65372 KB Output is correct
5 Correct 10 ms 65372 KB Output is correct
6 Correct 9 ms 65484 KB Output is correct
7 Correct 9 ms 65480 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 65372 KB Output is correct
2 Correct 10 ms 65372 KB Output is correct
3 Correct 9 ms 65372 KB Output is correct
4 Correct 9 ms 65372 KB Output is correct
5 Correct 8 ms 65372 KB Output is correct
6 Correct 9 ms 65368 KB Output is correct
7 Correct 9 ms 65372 KB Output is correct
8 Correct 9 ms 65372 KB Output is correct
9 Correct 9 ms 65368 KB Output is correct
10 Correct 9 ms 65628 KB Output is correct
11 Correct 10 ms 65644 KB Output is correct
12 Correct 9 ms 65500 KB Output is correct
13 Correct 9 ms 65504 KB Output is correct
14 Correct 10 ms 65628 KB Output is correct
15 Correct 10 ms 65628 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 65372 KB Output is correct
2 Correct 9 ms 65420 KB Output is correct
3 Correct 9 ms 65372 KB Output is correct
4 Correct 9 ms 65480 KB Output is correct
5 Correct 9 ms 65368 KB Output is correct
6 Correct 9 ms 65372 KB Output is correct
7 Correct 10 ms 65668 KB Output is correct
8 Correct 9 ms 65624 KB Output is correct
9 Correct 9 ms 65372 KB Output is correct
10 Correct 9 ms 65628 KB Output is correct
11 Correct 10 ms 65628 KB Output is correct
12 Correct 9 ms 65524 KB Output is correct
13 Correct 10 ms 65368 KB Output is correct
14 Correct 10 ms 65628 KB Output is correct
15 Correct 11 ms 65628 KB Output is correct
16 Correct 10 ms 65628 KB Output is correct
17 Runtime error 65 ms 133200 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 65372 KB Output is correct
2 Correct 9 ms 65480 KB Output is correct
3 Correct 10 ms 65372 KB Output is correct
4 Correct 9 ms 65444 KB Output is correct
5 Correct 9 ms 65372 KB Output is correct
6 Correct 9 ms 65372 KB Output is correct
7 Correct 9 ms 65372 KB Output is correct
8 Correct 9 ms 65368 KB Output is correct
9 Correct 9 ms 65372 KB Output is correct
10 Correct 9 ms 65628 KB Output is correct
11 Correct 10 ms 65612 KB Output is correct
12 Correct 9 ms 65624 KB Output is correct
13 Correct 9 ms 65504 KB Output is correct
14 Correct 9 ms 65628 KB Output is correct
15 Correct 10 ms 65628 KB Output is correct
16 Correct 10 ms 65628 KB Output is correct
17 Runtime error 67 ms 133052 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 65372 KB Output is correct
2 Correct 9 ms 65372 KB Output is correct
3 Correct 9 ms 65392 KB Output is correct
4 Correct 9 ms 65368 KB Output is correct
5 Correct 9 ms 65372 KB Output is correct
6 Correct 9 ms 65452 KB Output is correct
7 Correct 9 ms 65372 KB Output is correct
8 Correct 9 ms 65424 KB Output is correct
9 Correct 9 ms 65372 KB Output is correct
10 Correct 9 ms 65480 KB Output is correct
11 Correct 10 ms 65628 KB Output is correct
12 Correct 9 ms 65512 KB Output is correct
13 Correct 9 ms 65628 KB Output is correct
14 Correct 10 ms 65628 KB Output is correct
15 Correct 10 ms 65628 KB Output is correct
16 Correct 9 ms 65604 KB Output is correct
17 Runtime error 67 ms 133204 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -