Submission #1044837

#	Time	Username	Problem	Language	Result	Execution time	Memory
1044837		vjudge1	Strange Device (APIO19_strange_device)	C++17	15 / 100	1478 ms	524288 KiB

strange_device

#include<bits/stdc++.h>
#define int long long
#define MOD 1000000007
#define all(x) x.begin(),x.end()
#define ff fir -st
#define ss second
#define pb push_back
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

using namespace std;

int32_t main(){
	int n,a,b;
	cin>>n>>a>>b;
	if(a>1000000 || b>1000000 || a*b>1000000){
		set<pair<int,int>>st;
		for(int i=0;i<n;i++){
			int l,r;
			cin>>l>>r;
			for(int j=l;j<=r;j++){
				st.insert(make_pair((j+(j/b))%a,j%b));
			}
		}
		cout<<st.size()<<endl;
		return 0;
	}
	set<pair<int,int>>st;
	map<pair<int,int>,int>mp;
	for(int i=0;!st.count(make_pair((i+i/b)%a,i%b));i++){
		st.insert(make_pair((i+i/b)%a,i%b));
		mp[make_pair((i+i/b)%a,i%b)]=i;
	}
	vector<int>pre(st.size()+5);
	for(int i=0;i<n;i++){
		int l,r;
		cin>>l>>r;
		if(r-l+1>=st.size()){
			cout<<st.size()<<endl;
			return 0;
		}
		int x=mp[make_pair((l+l/b)%a,l%b)],y=mp[make_pair((r+r/b)%a,r%b)];
		if(x>y){
			pre[0]++;
			pre[y+1]--;
			pre[x]++;
			pre[st.size()]--;
		}
		else{
			pre[x]++;
			pre[y+1]--;
		}
	}
	int ans=0;
	for(int i=0;i<st.size();i++){
		pre[i]+=(i==0?0:pre[i-1]);
		ans+=(pre[i]!=0);
	}
	cout<<ans<<endl;
}

Compilation message (stderr)

strange_device.cpp: In function 'int32_t main()':
strange_device.cpp:37:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::set<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |   if(r-l+1>=st.size()){
      |      ~~~~~^~~~~~~~~~~
strange_device.cpp:54:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::set<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |  for(int i=0;i<st.size();i++){
      |              ~^~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 0 / 5
• Subtask 3: 5 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20
• Subtask 8: 0 / 30