Submission #1118940

#	Time	Username	Problem	Language	Result	Execution time	Memory
1118940		vjudge1	Strange Device (APIO19_strange_device)	C++17	10 / 100	5059 ms	524288 KiB

strange_device

#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;
		if(log(A) + log(B) > 18)cout << r - l + 1;
		else cout << min(A * B, 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 (stderr)

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: 10 / 10
• Subtask 2: 0 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20
• Subtask 8: 0 / 30