oj.uz

Submission #1118937

# Submission time Handle Problem Language Result Execution time Memory
1118937 2024-11-26T12:18:02 Z vjudge1 Strange Device (APIO19_strange_device) C++17
0 / 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 = 1; i <= n; i++) {
	// 	cout << (i + (i / B)) % A << ' ' << i % B << '\n';
	// }
	// return;
	if(n == 1) {
		int l, r;
		cin>>l>>r;
		cout << min(A * B, r - l + 1) << '\n';
		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);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 55 ms 12636 KB Output is correct
3 Correct 81 ms 18248 KB Output is correct
4 Correct 4 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 592 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 7 ms 1104 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 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 39 ms 7116 KB Output is correct
16 Correct 31 ms 7208 KB Output is correct
17 Correct 55 ms 10312 KB Output is correct
18 Incorrect 1 ms 592 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 504 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 508 KB Output is correct
2 Correct 151 ms 32396 KB Output is correct
3 Correct 188 ms 32068 KB Output is correct
4 Correct 132 ms 30616 KB Output is correct
5 Execution timed out 5040 ms 62520 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 540 ms 100044 KB Output is correct
3 Runtime error 2550 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 540 ms 100044 KB Output is correct
3 Runtime error 2550 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 540 ms 100044 KB Output is correct
3 Runtime error 2550 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Runtime error 1954 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 55 ms 12636 KB Output is correct
3 Correct 81 ms 18248 KB Output is correct
4 Correct 4 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 592 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 7 ms 1104 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 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 39 ms 7116 KB Output is correct
16 Correct 31 ms 7208 KB Output is correct
17 Correct 55 ms 10312 KB Output is correct
18 Incorrect 1 ms 592 KB Output isn't correct
19 Halted 0 ms 0 KB -