oj.uz

Submission #568307

# Submission time Handle Problem Language Result Execution time Memory
568307 2022-05-25T08:11:10 Z Baytoro Strange Device (APIO19_strange_device) C++17
40 / 100
 726 ms 62956 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;
		}
		if(!check)
			continue;
		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:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | 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);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 9 ms 852 KB Output is correct
3 Correct 7 ms 860 KB Output is correct
4 Correct 0 ms 212 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 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 6 ms 852 KB Output is correct
17 Correct 63 ms 6448 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# 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

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 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 307 ms 296 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 626 ms 62856 KB Output is correct
3 Incorrect 520 ms 12848 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 626 ms 62856 KB Output is correct
3 Incorrect 520 ms 12848 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 626 ms 62856 KB Output is correct
3 Incorrect 520 ms 12848 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 232 KB Output is correct
2 Correct 83 ms 6608 KB Output is correct
3 Correct 63 ms 6528 KB Output is correct
4 Correct 726 ms 62920 KB Output is correct
5 Correct 64 ms 6492 KB Output is correct
6 Correct 89 ms 6480 KB Output is correct
7 Correct 87 ms 6452 KB Output is correct
8 Correct 74 ms 6560 KB Output is correct
9 Correct 73 ms 6464 KB Output is correct
10 Correct 55 ms 6564 KB Output is correct
11 Correct 64 ms 6484 KB Output is correct
12 Correct 61 ms 6444 KB Output is correct
13 Correct 79 ms 6612 KB Output is correct
14 Correct 647 ms 62956 KB Output is correct
15 Correct 60 ms 6476 KB Output is correct
16 Correct 608 ms 62884 KB Output is correct
17 Correct 607 ms 62896 KB Output is correct
18 Correct 1 ms 212 KB Output is correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 9 ms 852 KB Output is correct
3 Correct 7 ms 860 KB Output is correct
4 Correct 0 ms 212 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 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 6 ms 852 KB Output is correct
17 Correct 63 ms 6448 KB Output is correct
18 Correct 0 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 0 ms 212 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 307 ms 296 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 626 ms 62856 KB Output is correct
31 Incorrect 520 ms 12848 KB Output isn't correct
32 Halted 0 ms 0 KB -