oj.uz

Submission #933141

# Submission time Handle Problem Language Result Execution time Memory
933141 2024-02-25T07:00:19 Z 8pete8 Strange Device (APIO19_strange_device) C++17
65 / 100
 1131 ms 125864 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<cassert>
#include<limits.h>
#include<cmath>
#include<set>
#include<numeric> //gcd(a,b)
#include<algorithm>
#include<bitset> 
#include<stack>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define pppiiii pair<pii,pii>
#define ppii pair<int,pii>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pb push_back
//#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
#define int long long
const int mod=1e9+7,mxn=2e5,lg=30,inf=1e18+1,minf=-1e18,Mxn=2e6,root=700;
void setIO(string name){
	ios_base::sync_with_stdio(0); cin.tie(0);		
	freopen((name+".in").c_str(),"r",stdin);		
	freopen((name+".out").c_str(),"w",stdout);	
}	 
map<int,int>mp;
int GCD(int x, int y)
{
    if (y == 0) return x;
    return GCD(y, x%y);
}
int32_t main(){
	fastio
	int n;cin>>n;
	int a,b;cin>>a>>b;
	//100000000000000
	int k=min((a*(b+1))/GCD(a,b+1),inf);
	if(k!=inf)k=(k/(b+1));
	k=min(inf,k*b);
	mp[0]=0;
	mp[k-1]=0;
	if(k<=0)k=inf;
	for(int i=0;i<n;i++){
		int l,r;cin>>l>>r;
		l=(l%k);
		r=(r%k);
		mp[l-1]+=0;
		mp[l]+=1;
		//if(l>=k||r>=k)assert(0);
		if(r+1<k)mp[r+1]-=1;
		mp[r]+=0;
		if(l>r)mp[0]+=1;
	}
	int sum=0,ans=0,last=-1;
	for(auto i:mp){
		//if(i.f>k)break;
		sum+=i.s;
		if(sum>0)ans+=i.f-last;
		last=i.f;
	}
	cout<<ans;


	/*
	observation:
	y=t mod b
	x=(t+(k*b)+[t/b]+k)%a
	x=t+t[t/b]%a
	(k*(b+1))%a==0
	case 1 : (b+1)%a==0 -> k can be anything -> if y equal is equal ->k==1
	case 2 : k%a==0 -> k=g(a) -> k is a multiple of a ->val jump every k*b
	*|k=lcm(a,b+1)/(b+1)|*
	considering 1 range l,r
	first occurance of y=t mod b
 
	if r-l+1>k then it will cover all k
 
	block of b (range where all y value will be distinct)
	|		|		|		|
	if(k==2)
	block will be (range where all (x,y) value will be distinct)
	|				|				|
	
	find ways to count x%(k) 
	in a given set of range l,r
	l,r will cover a range of block
	can use prefix sum??
	*/
}

Compilation message

strange_device.cpp: In function 'void setIO(std::string)':
strange_device.cpp:37:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
strange_device.cpp:38:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 7 ms 1952 KB Output is correct
3 Correct 7 ms 2008 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 452 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 456 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 6 ms 1628 KB Output is correct
17 Correct 64 ms 6804 KB Output is correct
18 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 5.0

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

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 186 ms 428 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 625 ms 62860 KB Output is correct
3 Correct 831 ms 125608 KB Output is correct
4 Correct 935 ms 125776 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 625 ms 62860 KB Output is correct
3 Correct 831 ms 125608 KB Output is correct
4 Correct 935 ms 125776 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 813 ms 125712 KB Output is correct
7 Correct 680 ms 62904 KB Output is correct
8 Correct 810 ms 125524 KB Output is correct
9 Correct 1064 ms 125780 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 625 ms 62860 KB Output is correct
3 Correct 831 ms 125608 KB Output is correct
4 Correct 935 ms 125776 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 65 ms 12884 KB Output is correct
7 Correct 70 ms 12956 KB Output is correct
8 Correct 79 ms 13164 KB Output is correct
9 Correct 72 ms 12884 KB Output is correct
10 Correct 66 ms 12900 KB Output is correct
11 Correct 64 ms 12880 KB Output is correct
12 Correct 65 ms 12884 KB Output is correct
13 Correct 90 ms 12740 KB Output is correct
14 Correct 64 ms 12904 KB Output is correct
15 Correct 74 ms 12888 KB Output is correct
16 Correct 76 ms 12912 KB Output is correct
17 Correct 70 ms 12880 KB Output is correct
18 Correct 766 ms 125548 KB Output is correct
19 Correct 935 ms 125480 KB Output is correct
20 Correct 1012 ms 125556 KB Output is correct
21 Correct 70 ms 12940 KB Output is correct
22 Correct 69 ms 12948 KB Output is correct
23 Correct 81 ms 344 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 75 ms 12972 KB Output is correct
3 Correct 78 ms 12880 KB Output is correct
4 Correct 1010 ms 125864 KB Output is correct
5 Correct 76 ms 12884 KB Output is correct
6 Correct 77 ms 12808 KB Output is correct
7 Correct 76 ms 12828 KB Output is correct
8 Correct 78 ms 12904 KB Output is correct
9 Correct 72 ms 12796 KB Output is correct
10 Correct 69 ms 12956 KB Output is correct
11 Correct 75 ms 12992 KB Output is correct
12 Correct 77 ms 12832 KB Output is correct
13 Correct 81 ms 12944 KB Output is correct
14 Correct 1131 ms 125864 KB Output is correct
15 Correct 67 ms 12884 KB Output is correct
16 Correct 771 ms 125796 KB Output is correct
17 Correct 770 ms 125728 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 7 ms 1952 KB Output is correct
3 Correct 7 ms 2008 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 452 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 456 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 6 ms 1628 KB Output is correct
17 Correct 64 ms 6804 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Incorrect 1 ms 344 KB Output isn't correct
21 Halted 0 ms 0 KB -