답안 #1118948

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1118948 2024-11-26T12:34:22 Z vjudge1 이상한 기계 (APIO19_strange_device) C++17
10 / 100
5000 ms 524288 KB
#include <bits/stdc++.h>
#pragma optimize("g", on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
void Freopen () {
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif
}
using namespace std;
#define fi first
#define se second
#define int long long
const int N = 3e5 + 7;

void solve() {
	int n, A, B;
	cin>>n>>A>>B;
	// for(int i = 0; i <= n; i++) {
	// 	cout << ((i + (i / B)) % A) << ' ' << (i % B) << '\n';
	// }
	// return;
	if(n == 1) {
		int l, r;
		cin>>l>>r;
		if(log(A) + log(B) > 18)cout << r - l + 1;
		else cout << min(A * B + 1, r - l + 1);
		return;
	}
	map<pair<int, int>, int> mp;
	int cnt = 0;
	for(int i = 1; i <= n; i++) {
		int l, r;
		cin>>l>>r;
		for(int j = l; j <= r; j++) {
			int x = (j + (j / B)) % A, y = j % B;
			if(!mp[{x, y}])cnt ++, mp[{x, y}] = 1;
		}
	}
	cout << cnt << '\n';
}
signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//Freopen();
	int T = 1;
	// cin>>T;
	while(T --)solve();
}

Compilation message

strange_device.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize("g", on)
      | 
strange_device.cpp: In function 'void Freopen()':
strange_device.cpp:10:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
strange_device.cpp:11:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 47 ms 12728 KB Output is correct
3 Correct 79 ms 18248 KB Output is correct
4 Correct 3 ms 848 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 764 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 8 ms 1360 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 504 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 34 ms 7064 KB Output is correct
16 Correct 31 ms 7240 KB Output is correct
17 Correct 63 ms 8792 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 1 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 140 ms 32200 KB Output is correct
3 Correct 154 ms 32124 KB Output is correct
4 Correct 122 ms 30632 KB Output is correct
5 Execution timed out 5069 ms 62536 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 525 ms 95672 KB Output is correct
3 Runtime error 2424 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 525 ms 95672 KB Output is correct
3 Runtime error 2424 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 525 ms 95672 KB Output is correct
3 Runtime error 2424 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Runtime error 1824 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 47 ms 12728 KB Output is correct
3 Correct 79 ms 18248 KB Output is correct
4 Correct 3 ms 848 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 764 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 8 ms 1360 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 504 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 34 ms 7064 KB Output is correct
16 Correct 31 ms 7240 KB Output is correct
17 Correct 63 ms 8792 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Incorrect 1 ms 336 KB Output isn't correct
21 Halted 0 ms 0 KB -