oj.uz

답안 #405273

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
405273 2021-05-16T06:56:50 Z pavement 이상한 기계 (APIO19_strange_device) C++17
5 / 100
 493 ms 16844 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef double db;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int N, A, B, P, f = -1, st, ans;
vector<ii> seg;

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> A >> B;
	P = A / __gcd(A, B + 1) * B;
	assert(__gcd(A / __gcd(A, B + 1), B) == 1);
	for (int i = 1, l, r; i <= N; i++) {
		cin >> l >> r;
		if (r - l + 1 >= 2 * P) return cout << P << '\n', 0;
		if (l + P - (l % P) > r) seg.eb(l % P, r % P);
		else seg.eb(l % P, P - 1), seg.eb(0, r % P);
	}
	sort(seg.begin(), seg.end());
	for (auto i : seg) {
		if (i.first > f) {
			if (f != -1) ans += f - st + 1;
			st = i.first;
		}
		f = max(f, i.second);
	}
	ans += f - st + 1;
	cout << ans << '\n';
}

Compilation message

strange_device.cpp:31:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   31 | main() {
      | ^~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Runtime error 1 ms 460 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Runtime error 2 ms 460 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Runtime error 1 ms 460 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 493 ms 16784 KB Output is correct
3 Correct 486 ms 16824 KB Output is correct
4 Correct 464 ms 16844 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 493 ms 16784 KB Output is correct
3 Correct 486 ms 16824 KB Output is correct
4 Correct 464 ms 16844 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 483 ms 16820 KB Output is correct
7 Correct 491 ms 16800 KB Output is correct
8 Runtime error 1 ms 460 KB Execution killed with signal 6
9 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 493 ms 16784 KB Output is correct
3 Correct 486 ms 16824 KB Output is correct
4 Correct 464 ms 16844 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Runtime error 2 ms 460 KB Execution killed with signal 6
7 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Runtime error 2 ms 460 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Runtime error 1 ms 460 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -