oj.uz

Submission #964818

# Submission time Handle Problem Language Result Execution time Memory
964818 2024-04-17T15:34:38 Z LCJLY Strange Device (APIO19_strange_device) C++14
0 / 100
 25 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;	
 
//#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<long long,long long>pii;
typedef pair<int,pii>pi2;

int n,a,b;
int f(int index){	
	return (index+index/b)%a;
}

int f2(int index){
	return index%b;
}

void solve(){
	//cin >> n >> a >> b;
	//int temp,temp2;
	//for(int x=0;x<n;x++){
		//cin >> temp >> temp2;
		//for(int y=temp;y<=temp2;y++){
			//cout << y << ": " << f(y) << " " << f2(y);
			//if(f(y)==0&&f2(y)==0){
				//cout << " st\n";
			//}
			//else cout << "\n";
		//}
	//}
	
	cin >> n >> a >> b;
	
	__int128 lcm=a*b/__gcd(a,b+1);
	//if(lcm<1e18){
		//lcm*=b;
	//}
	
	//show(lcm,(int)lcm);
	
	map<int,int>mp;
	
	int temp,temp2;
	for(int x=0;x<n;x++){
		cin >> temp >> temp2;
		int blk=temp/lcm;
		int blk2=temp2/lcm;
		temp%=lcm;
		temp2%=lcm;
		
		if(blk==blk2){
			mp[temp]++;
			mp[temp2+1]--;
		}
		else{
			mp[temp]++;
			mp[lcm]--;
			mp[0]++;	
			mp[temp2+1]--;
		}
	}
	
	int counter=0;
	int last=-1;
	int ans=0;
	for(auto it:mp){
		if(last!=-1&&counter>0){
			ans+=it.first-last;
		}
		counter+=it.second;
		last=it.first;
	}
	cout << ans;
}
 
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
	//cin >> t;
	while(t--){
		solve();
	}
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

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

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 25 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 25 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 25 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 3 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -