Submission #568306

# Submission time Handle Problem Language Result Execution time Memory
568306 2022-05-25T08:10:10 Z Baytoro Strange Device (APIO19_strange_device) C++17
40 / 100
688 ms 100132 KB
#include <bits/stdc++.h>
using namespace std;
#define Baytoro_Mayrambekov void solve()
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
const int INF=1e9;
void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
int binpow(int a,int n){
	if(n==0)
		return 1;
	if(n%2==1)
		return binpow(a, n-1)*a;
	else{
		int b=binpow(a, n/2);
		return b*b;
	}
}
int a,b,c,n,m,i,j,k,x,y,cnt=0,sum=0,res=0;
Baytoro_Mayrambekov{
	cin>>n>>a>>b;
	int mx=a/(__gcd(a,b+1));
	if(mx>INF)
		mx=INF;
	else
		mx*=b;
	bool check=1;
	set<pair<int,int>> st;
	for(i=0;i<n;i++){
		int l,r;
		cin>>l>>r;
		if(r-l+1>=mx && check){
			cout<<mx<<endl;
			check=0;
		}
		l%=mx;
		r%=mx;
		if(l<=r){
			st.insert({l,r});
		}
		else{
			st.insert({l,mx-1});
			st.insert({0,r});
		}
	}
	if(!check){
		return;
	}
	res=0;
	int x=-1;
	for(auto it: st){
		if(x<it.fr)
			res+=it.sc-it.fr+1;
		else if(x<it.sc)
			res+=it.sc-x;
		x=max(x,it.sc);
	}
	cout<<res<<endl;
}
main(){
	ios;
	int T=1;
	//cin>>T;
	while(T--){
		solve();
	}
}




Compilation message

strange_device.cpp:68:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   68 | main(){
      | ^~~~
strange_device.cpp: In function 'void fopn(std::string)':
strange_device.cpp:14:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
strange_device.cpp:15:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 6 ms 1236 KB Output is correct
3 Correct 6 ms 1236 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 6 ms 1236 KB Output is correct
17 Correct 56 ms 7064 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 278 ms 25372 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 635 ms 62952 KB Output is correct
3 Incorrect 558 ms 31024 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 635 ms 62952 KB Output is correct
3 Incorrect 558 ms 31024 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 635 ms 62952 KB Output is correct
3 Incorrect 558 ms 31024 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 62 ms 10248 KB Output is correct
3 Correct 58 ms 10216 KB Output is correct
4 Correct 618 ms 82608 KB Output is correct
5 Correct 61 ms 10260 KB Output is correct
6 Correct 61 ms 10272 KB Output is correct
7 Correct 59 ms 10204 KB Output is correct
8 Correct 72 ms 10188 KB Output is correct
9 Correct 58 ms 10200 KB Output is correct
10 Correct 59 ms 10256 KB Output is correct
11 Correct 61 ms 10188 KB Output is correct
12 Correct 54 ms 10276 KB Output is correct
13 Correct 59 ms 10184 KB Output is correct
14 Correct 688 ms 100132 KB Output is correct
15 Correct 56 ms 10160 KB Output is correct
16 Correct 617 ms 94936 KB Output is correct
17 Correct 611 ms 85004 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 6 ms 1236 KB Output is correct
3 Correct 6 ms 1236 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 6 ms 1236 KB Output is correct
17 Correct 56 ms 7064 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 278 ms 25372 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 635 ms 62952 KB Output is correct
31 Incorrect 558 ms 31024 KB Output isn't correct
32 Halted 0 ms 0 KB -