oj.uz

답안 #677169

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
677169 2023-01-02T13:39:54 Z faribourz 이상한 기계 (APIO19_strange_device) C++14
10 / 100
 5000 ms 524288 KB 
// Only GOD
// believe in yourself
// nemidam del be in darde donya!
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;

#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#define bit(x, y) ((x >> y)&1)
#define sz(x) (int)x.size()
#define kill(x) return cout << x << '\n', void()
#define KILL(x) return cout << x << '\n', 0
#define int ll
const int N = 1e5+10;
const int INF = INT_MAX;
int32_t main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int n, A, B;
	cin >> n >> A >> B;
	int C = A / __gcd(A, B+1);
	if(INF / C <= B){
		int sum = 0;
		for(int i = 0; i < n; i++){
			int l, r;
			cin >> l >> r;
			sum += r - l + 1;
		}
		KILL(sum);
	}
	int mul = C*B;
	set<int> s;
	for(int i = 0; i < n; i++){
		int l, r;
		cin >> l >> r;
		for(int j = l; j <= r; j++){
			s.insert(j % mul);
		}
	}
	cout << sz(s) << '\n';
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 33 ms 9300 KB Output is correct
3 Correct 55 ms 13508 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 5 ms 980 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 26 ms 5336 KB Output is correct
16 Correct 19 ms 5076 KB Output is correct
17 Correct 48 ms 4992 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 5.0

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

Subtask #3
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 86 ms 24276 KB Output is correct
3 Correct 108 ms 24100 KB Output is correct
4 Correct 85 ms 23012 KB Output is correct
5 Execution timed out 5053 ms 46956 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

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

Subtask #5
0 / 5.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 20.0

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

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 33 ms 9300 KB Output is correct
3 Correct 55 ms 13508 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 5 ms 980 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 26 ms 5336 KB Output is correct
16 Correct 19 ms 5076 KB Output is correct
17 Correct 48 ms 4992 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Runtime error 3678 ms 524288 KB Execution killed with signal 9
21 Halted 0 ms 0 KB -