oj.uz

답안 #255037

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
255037 2020-07-31T05:41:58 Z ruler 이상한 기계 (APIO19_strange_device) C++14
0 / 100
 144 ms 33344 KB 
// IOI 2021
#include <bits/stdc++.h>
using namespace std;
 
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef pair<int, int> pii;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
 
////////////////////////////////////////////////////////////////////
 
const int N = 1e5 + 5;

typedef pair<ll, ll> pll;
ll GCD(ll a, ll b) { return !b ? a : GCD(b, a % b); }

int main() {
 
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	mt19937 Rnd(time(0));

	int n; cin >> n;
	ll a, b; cin >> a >> b;
	ll g = GCD(a, b + 1);
	ll k = INF;
	if (a / g <= INF / b) k = a * b / g;
	
	vector<pll> V;
	for (int i = 0; i < n; i++) {
		int l, r; cin >> l >> r;
		if (r - l + 1 >= k) die(k);
		l %= k, r %= k;
		if (l <= r) V.push_back(make_pair(l, r));
		else V.push_back(make_pair(0, r)), V.push_back(make_pair(l, k - 1));;
	}
	sort(all(V));
	ll mx = 0, ans = 0;
	for (auto [l, r] : V) {
		mx = max(mx, l);
		if (mx <= r) ans += r - mx + 1;
		mx = max(mx, r + 1);
	}
	cout << ans << endl;

	return 0;
}

Compilation message

strange_device.cpp: In function 'int main()':
strange_device.cpp:47:12: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
  for (auto [l, r] : V) {
            ^

Subtask #1
0 / 10.0

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

Subtask #2
0 / 5.0

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

Subtask #3
0 / 5.0

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

Subtask #4
0 / 5.0

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

Subtask #5
0 / 5.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 20.0

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

Subtask #8
0 / 30.0

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