답안 #933128

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
933128 2024-02-25T06:38:28 Z 8pete8 이상한 기계 (APIO19_strange_device) C++17
35 / 100
1128 ms 126060 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=2e18,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;
int32_t main(){
	fastio
	int n;cin>>n;
	int a,b;cin>>a>>b;
	int k=(a*(b+1))/gcd(a,b+1);
	k=(k/(b+1));
	k=min(inf,k*b);
	mp[k-1]=0;
	mp[0]=0;
	bool yes=false;
	for(int i=0;i<n;i++){
		int l,r;cin>>l>>r;
		if(r-l+1>=k)yes=true;
		l%=k,r%=k;
		mp[l-1]+=0;
		mp[l]+=1,mp[r+1]-=1;
		mp[r]+=0;
		if(l>r)mp[0]+=1;
	}
	if(yes)return cout<<k<<'\n',0;
	int sum=0,ans=0,last=-1;
	for(auto i:mp){
		if(i.f>k)break;
		sum+=i.s;
		if(sum)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%(a*b) or x%b
	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);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 6 ms 1640 KB Output is correct
3 Correct 7 ms 1628 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 376 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 448 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 6 ms 1628 KB Output is correct
17 Correct 58 ms 6728 KB Output is correct
18 Incorrect 0 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 175 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 611 ms 62932 KB Output is correct
3 Correct 846 ms 125716 KB Output is correct
4 Correct 982 ms 125692 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 611 ms 62932 KB Output is correct
3 Correct 846 ms 125716 KB Output is correct
4 Correct 982 ms 125692 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 787 ms 125980 KB Output is correct
7 Correct 652 ms 63060 KB Output is correct
8 Correct 784 ms 125708 KB Output is correct
9 Correct 1125 ms 125732 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 611 ms 62932 KB Output is correct
3 Correct 846 ms 125716 KB Output is correct
4 Correct 982 ms 125692 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 60 ms 12880 KB Output is correct
7 Correct 62 ms 13000 KB Output is correct
8 Correct 68 ms 12880 KB Output is correct
9 Correct 71 ms 12924 KB Output is correct
10 Correct 61 ms 12884 KB Output is correct
11 Correct 80 ms 12888 KB Output is correct
12 Correct 66 ms 12800 KB Output is correct
13 Correct 72 ms 12876 KB Output is correct
14 Correct 64 ms 12884 KB Output is correct
15 Correct 73 ms 12884 KB Output is correct
16 Correct 75 ms 12872 KB Output is correct
17 Correct 70 ms 12880 KB Output is correct
18 Correct 755 ms 126060 KB Output is correct
19 Correct 946 ms 125888 KB Output is correct
20 Correct 964 ms 125492 KB Output is correct
21 Correct 70 ms 13100 KB Output is correct
22 Correct 69 ms 12884 KB Output is correct
23 Correct 78 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 74 ms 12816 KB Output is correct
3 Correct 77 ms 12944 KB Output is correct
4 Correct 932 ms 125520 KB Output is correct
5 Correct 77 ms 12916 KB Output is correct
6 Correct 82 ms 12968 KB Output is correct
7 Correct 77 ms 12748 KB Output is correct
8 Correct 75 ms 12976 KB Output is correct
9 Correct 79 ms 12928 KB Output is correct
10 Correct 67 ms 12880 KB Output is correct
11 Correct 69 ms 12976 KB Output is correct
12 Correct 68 ms 12884 KB Output is correct
13 Correct 74 ms 12888 KB Output is correct
14 Correct 1128 ms 125524 KB Output is correct
15 Correct 63 ms 12884 KB Output is correct
16 Correct 752 ms 125548 KB Output is correct
17 Correct 808 ms 125908 KB Output is correct
18 Incorrect 0 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 6 ms 1640 KB Output is correct
3 Correct 7 ms 1628 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 376 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 448 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 6 ms 1628 KB Output is correct
17 Correct 58 ms 6728 KB Output is correct
18 Incorrect 0 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -