oj.uz

답안 #873483

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
873483 2023-11-15T07:09:22 Z Danet 이상한 기계 (APIO19_strange_device) C++14
20 / 100
 1154 ms 100200 KB 
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")

#define tof_io  ios_base::sync_with_stdio(false);cin.tie(0) , cout.tie(0);
#define double  long double
#define int     long long
#define pb      push_back

#define all(x)  x.begin(),x.end()
#define endl    '\n'
#define sz(x) 	x.size()
//const int mod = 998244353; //998244353 1e9+7 1e9+9
const int N = 5e3 + 23;	
const int lg = 23;
const int inf = 1e9;
int fac[N];
int inv[N];
//int  dnt_pow	(int a, int b, int md = mod){int ans = 1; while(b){if(b&1){ans = (a*ans)%md;}a = (a*a)%md;b >>= 1;}return ans ;}
//void dnt_bld	(){fac[0] = 1; inv[0] = dnt_pow(fac[0],mod-2) ;for(int i = 1 ; i < N ; i++) {fac[i] = (fac[i-1] * i) % mod;inv[i] = dnt_pow( fac[i] , mod-2);}}
//int  dnt_ncr	(int r,int n){if(r>n) return 0; return fac[n] * inv[r] % mod * inv[n-r] % mod;}
void add (set<pair<int, int>>& st, int l, int r) 
{
	auto it = st.lower_bound({l, 0}), tmp = it;
	if (it != st.begin() && (--tmp)->second >= l) 
	{
		l = tmp->first;
		r = max(r, tmp->second);
		st.erase(tmp);
	}
	while (it != st.end()) 
	{
		if (r >= it->first) 
		{
			r = max(r, it->second);
			it = st.erase(it);
		} 
		else break;
	}
	st.insert({l, r});
}
 
int32_t main () 
{
	int n, a, b;
	cin >> n >> a >> b;
	int mod;
	if (a / __gcd(a, b+1) > inf / b) mod = inf;
	else mod = a / __gcd(a, b+1) * b;
	set<pair<int, int>> st;
	while (n--) 
	{
		int l, r;
		cin >> l >> r;
		if (r-l+1 >= mod) 
		{
			cout << mod << endl;
			return 0;
		}
		if (l % mod > r % mod) 
		{
			add(st, 0, r % mod);
			add(st, l % mod, mod-1);
		} else add(st, l % mod, r % mod);
	}
	int ans = 0;
	for (auto e: st) 
	{
		int l = e.first;
		int r = e.second;
		ans += r-l+1;
	}
	cout << ans ;
	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 432 KB Output is correct
2 Correct 11 ms 1368 KB Output is correct
3 Correct 11 ms 1372 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 10 ms 1380 KB Output is correct
17 Correct 121 ms 10216 KB Output is correct
18 Correct 0 ms 436 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 436 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 448 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 691 ms 25424 KB Output is correct

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1154 ms 100200 KB Output is correct
3 Incorrect 962 ms 39432 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1154 ms 100200 KB Output is correct
3 Incorrect 962 ms 39432 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1154 ms 100200 KB Output is correct
3 Incorrect 962 ms 39432 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 112 ms 10324 KB Output is correct
3 Incorrect 104 ms 5056 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 432 KB Output is correct
2 Correct 11 ms 1368 KB Output is correct
3 Correct 11 ms 1372 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 10 ms 1380 KB Output is correct
17 Correct 121 ms 10216 KB Output is correct
18 Correct 0 ms 436 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 436 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 448 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 691 ms 25424 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1154 ms 100200 KB Output is correct
31 Incorrect 962 ms 39432 KB Output isn't correct
32 Halted 0 ms 0 KB -