oj.uz

답안 #751200

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
751200 2023-05-31T07:46:35 Z minhcool 열대 식물원 (Tropical Garden) (IOI11_garden) C++17
100 / 100
 2622 ms 72992 KB 
#include "garden.h"
#include "gardenlib.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
 
//#define ll long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
 
/*
Algo: We have 2n nodes (i, 0/1 - is last node the largest)
Just for lmao
*/
 
typedef pair<ll, ll> ii;
typedef pair<ii, ll> iii;
typedef pair<ii, ii> iiii;
 
const ll N = 3e5 + 5;
 
const ll oo = 1e18 + 7, mod = 1e9 + 7;
 
mt19937 rng(1);
 
ll rnd(ll l, ll r){
	ll temp = rng() % (r - l + 1);
	return abs(temp) + l;
}
 
ll n, m, p, q;
vector<ll> Adj[N]; 
 
// cycles that node u can get
vector<ii> cyc[N][2];
 
//map<ii, ll> mp;
 
ii nxt[N][2];
 
ll mn_dist[N][2];
 
vector<ii> Adj2[N][2];
 
iiii savee[N];
 
void count_routes(int N, int M, int P, int R[][2], int Q, int G[]){
	n = N, m = M, p = P;
	for(ll i = 0; i < m; i++){
		Adj[R[i][0]].pb(R[i][1]);
		Adj[R[i][1]].pb(R[i][0]);
		//mp[{min(R[i][0], R[i][1]), m}
	}
	for(ll i = 0; i < n; i++){
		// last trail is the best in all trails from i -> need to choose second if there is one
		if(Adj[i].size() >= 2) nxt[i][1] = {Adj[i][1], (Adj[Adj[i][1]][0] == i)};
		else nxt[i][1] = {Adj[i][0], (Adj[Adj[i][0]][0] == i)};
		nxt[i][0] = {Adj[i][0], (Adj[Adj[i][0]][0] == i)};
	}
	for(ll i = 0; i < n; i++){
		for(ll j = 0; j < 2; j++){
			Adj2[nxt[i][j].fi][nxt[i][j].se].pb({i, j});
		}
	}
	// finding the cycle for (p, 0)
	ii itr = {p, 0};
	ll len = 0;
	while((!len || itr != make_pair(p, 0LL)) && len <= 2 * n){
		len++;
		itr = nxt[itr.fi][itr.se];
	}
	if(len > 2 * n) len = oo;
	for(ll i = 0; i < n; i++) mn_dist[i][0] = mn_dist[i][1] = oo;
	mn_dist[p][0] = 0;
	queue<ii> bfs;
	bfs.push({p, 0});
	while(!bfs.empty()){
		ii u = bfs.front();
		bfs.pop();
		for(auto it : Adj2[u.fi][u.se]){
			if(mn_dist[it.fi][it.se] != oo) continue;
			mn_dist[it.fi][it.se] = mn_dist[u.fi][u.se] + 1;
			bfs.push(it);
		}
	}
	for(ll i = 0; i < n; i++){
		for(ll j = 0; j < 2; j++){
			if(mn_dist[i][j] == oo) continue;
			cyc[i][j].pb({mn_dist[i][j], len});	
		}
	}
	itr = {p, 1};
	len = 0;
	while((!len || itr != make_pair(p, 1LL)) && len <= 2 * n){
		len++;
		itr = nxt[itr.fi][itr.se];
	}
	if(len > 2 * n) len = oo;
	for(ll i = 0; i < n; i++) mn_dist[i][0] = mn_dist[i][1] = oo;
	mn_dist[p][1] = 0;
	//queue<ii> bfs;
	bfs.push({p, 1});
	//cout << "OKAY\n";
	while(!bfs.empty()){
		ii u = bfs.front();
		bfs.pop();
		for(auto it : Adj2[u.fi][u.se]){
			if(mn_dist[it.fi][it.se] != oo) continue;
			mn_dist[it.fi][it.se] = mn_dist[u.fi][u.se] + 1;
			bfs.push(it);
		}
	}
	for(ll i = 0; i < n; i++){
		for(ll j = 0; j < 2; j++){
			if(mn_dist[i][j] == oo) continue;
			cyc[i][j].pb({mn_dist[i][j], len});	
			//cout << i << " " << j << " " << mn_dist[i][j] << " " << len << "\n";
		}
	}
//	exit(0);
    for(ll i = 0; i < n; i++){
    	ii temp = {Adj[i][0], (Adj[Adj[i][0]][0] == i)};
        savee[i] = {{-1, -1}, {-1, -1}};
        for(auto it : cyc[temp.fi][temp.se]){
        	if(savee[i].fi.fi < 0) savee[i].fi = it;
          else savee[i].se = it;
        }
    }
	for(ll i = 0; i < Q; i++){
		ll tol = 0;
		G[i]--;
		for(ll j = 0; j < n; j++){
			//cout << temp.fi << " " << temp.se << "\n";
			//cout << j << " " << Adj[j][0] << "\n";
			//continue;
			bool ck = 0;
			if(savee[j].fi.fi >= 0){
                ll diff = G[i] - savee[j].fi.fi;
            	ck = (diff >= 0 && !(diff % savee[j].fi.se));
                if(!ck && savee[j].se.fi >= 0){
                  ll diff = G[i] - savee[j].se.fi;
                  ck = (diff >= 0 && !(diff % savee[j].se.se));
                }
            }
			tol += ck;
		}
		//cout << i << " " << tol << "\n";
		answer(tol);
	//if(n >= 100000 && Q > 1) exit(0);
	}
}

Subtask #1
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 35668 KB Output is correct
2 Correct 17 ms 35720 KB Output is correct
3 Correct 19 ms 35768 KB Output is correct
4 Correct 18 ms 35540 KB Output is correct
5 Correct 18 ms 35572 KB Output is correct
6 Correct 18 ms 35780 KB Output is correct
7 Correct 18 ms 35564 KB Output is correct
8 Correct 19 ms 35796 KB Output is correct
9 Correct 20 ms 36000 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 35668 KB Output is correct
2 Correct 17 ms 35720 KB Output is correct
3 Correct 19 ms 35768 KB Output is correct
4 Correct 18 ms 35540 KB Output is correct
5 Correct 18 ms 35572 KB Output is correct
6 Correct 18 ms 35780 KB Output is correct
7 Correct 18 ms 35564 KB Output is correct
8 Correct 19 ms 35796 KB Output is correct
9 Correct 20 ms 36000 KB Output is correct
10 Correct 16 ms 35540 KB Output is correct
11 Correct 28 ms 39612 KB Output is correct
12 Correct 41 ms 42576 KB Output is correct
13 Correct 77 ms 58844 KB Output is correct
14 Correct 125 ms 60928 KB Output is correct
15 Correct 176 ms 68244 KB Output is correct
16 Correct 123 ms 58484 KB Output is correct
17 Correct 117 ms 55692 KB Output is correct
18 Correct 44 ms 42708 KB Output is correct
19 Correct 114 ms 60620 KB Output is correct
20 Correct 157 ms 68460 KB Output is correct
21 Correct 120 ms 58460 KB Output is correct
22 Correct 118 ms 55552 KB Output is correct
23 Correct 119 ms 62588 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 35668 KB Output is correct
2 Correct 17 ms 35720 KB Output is correct
3 Correct 19 ms 35768 KB Output is correct
4 Correct 18 ms 35540 KB Output is correct
5 Correct 18 ms 35572 KB Output is correct
6 Correct 18 ms 35780 KB Output is correct
7 Correct 18 ms 35564 KB Output is correct
8 Correct 19 ms 35796 KB Output is correct
9 Correct 20 ms 36000 KB Output is correct
10 Correct 16 ms 35540 KB Output is correct
11 Correct 28 ms 39612 KB Output is correct
12 Correct 41 ms 42576 KB Output is correct
13 Correct 77 ms 58844 KB Output is correct
14 Correct 125 ms 60928 KB Output is correct
15 Correct 176 ms 68244 KB Output is correct
16 Correct 123 ms 58484 KB Output is correct
17 Correct 117 ms 55692 KB Output is correct
18 Correct 44 ms 42708 KB Output is correct
19 Correct 114 ms 60620 KB Output is correct
20 Correct 157 ms 68460 KB Output is correct
21 Correct 120 ms 58460 KB Output is correct
22 Correct 118 ms 55552 KB Output is correct
23 Correct 119 ms 62588 KB Output is correct
24 Correct 19 ms 35540 KB Output is correct
25 Correct 83 ms 39632 KB Output is correct
26 Correct 102 ms 42612 KB Output is correct
27 Correct 2263 ms 59052 KB Output is correct
28 Correct 746 ms 60912 KB Output is correct
29 Correct 2590 ms 68392 KB Output is correct
30 Correct 1442 ms 59468 KB Output is correct
31 Correct 1498 ms 56580 KB Output is correct
32 Correct 116 ms 43240 KB Output is correct
33 Correct 755 ms 61840 KB Output is correct
34 Correct 2622 ms 69280 KB Output is correct
35 Correct 1573 ms 59632 KB Output is correct
36 Correct 1724 ms 57304 KB Output is correct
37 Correct 537 ms 63600 KB Output is correct
38 Correct 2024 ms 72992 KB Output is correct