oj.uz

답안 #1028210

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1028210 2024-07-19T15:15:58 Z Issa Fire (BOI24_fire) C++17
21 / 100
 104 ms 42176 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define ent "\n"

const int maxn = 1e6 + 100;
const ll INF = (ll)1e18 + 100;
const int inf = 1e9 + 100;
const int MOD = 1e9 + 7;
const int maxl = 20;
const int P = 31;

int n, m;
pii a[maxn];
int p[maxl][maxn];

void test(){
	cin >> n >> m;
	vector<pii> v; int en = n;
	for(int i = 1; i <= n; i++){
		cin >> a[i].first >> a[i].second;
		if(a[i].second < a[i].first) a[i].second += m;
		else{
			a[++en] = a[i];
			a[en].first += m;
			a[en].second += m;
		}
	}
	n = en;
	sort(a + 1, a + n + 1);
	for(int i = 1; i <= n; i++){
		v.push_back({a[i].second, i});
	}
	sort(v.begin(), v.end());
	int j = 0, mx = 0;
	for(auto [x, i]: v){
		while(j < n && a[j+1].first <= x){
			j++; if(!mx || a[mx].second < a[j].second) mx = j;
		}
		p[0][i] = j;
	}
	for(int k = 1; k < maxl; k++){
		for(int i = 1; i <= n; i++){
			p[k][i] = p[k-1][p[k-1][i]];
		}
	}
	int ans = inf;
	for(int i = 1; i <= n; i++){
		int j = i, cnt = 0;
		for(int k = maxl - 1; k >= 0; k--){
			if(a[p[k][j]].second - a[i].first < m){
				j = p[k][j]; cnt += (1<<k);
			}
		}
		j = p[0][j]; cnt++;
		if(a[j].second - a[i].first >= m){
			ans = min(ans, cnt + 1);
		}
	}
	if(ans == inf) ans = -1;
	cout << ans;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int t; t = 1;
    while(t--) test();
    cout << ent;
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Incorrect 0 ms 604 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Incorrect 0 ms 604 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Incorrect 0 ms 604 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Incorrect 0 ms 604 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 856 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 2 ms 1628 KB Output is correct
13 Correct 2 ms 1624 KB Output is correct
14 Correct 2 ms 1628 KB Output is correct
15 Correct 51 ms 28784 KB Output is correct
16 Correct 104 ms 39556 KB Output is correct
17 Correct 94 ms 42176 KB Output is correct
18 Correct 94 ms 40168 KB Output is correct
19 Correct 94 ms 41920 KB Output is correct
20 Correct 89 ms 41152 KB Output is correct

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Incorrect 0 ms 604 KB Output isn't correct
5 Halted 0 ms 0 KB -