oj.uz

Submission #346639

# Submission time Handle Problem Language Result Execution time Memory
346639 2021-01-10T13:58:00 Z YJU Strange Device (APIO19_strange_device) C++14
65 / 100
 549 ms 17244 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=2e5+5;
const ld pi=acos(-1);
const ll INF=1e18;
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

ll n,a,b,ans,last=-1,x,y;
vector<pll> v;

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>a>>b;
	ll g=__gcd(a,b+1);
	if(a/g>(INF+b-1)/b){
		REP(i,n)cin>>x>>y,ans+=y-x+1;
		cout<<ans<<"\n";return 0;
	}
	ll ab=(a/g*b);
	REP(i,n){
		cin>>x>>y;
		x%=ab;y%=ab;
		if(x>y){
			v.pb(mp(x,ab-1));
			v.pb(mp(0,y));
		}else{
			v.pb(mp(x,y));
		}
	}
	sort(v.begin(),v.end());
	for(auto i:v){
		ans+=max(0LL,i.Y-max(last,i.X-1));
		last=max(last,i.Y);
	}
	cout<<min(ans,ab)<<"\n";
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 5 ms 748 KB Output is correct
3 Correct 5 ms 748 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 372 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 6 ms 748 KB Output is correct
17 Correct 53 ms 2536 KB Output is correct
18 Correct 0 ms 364 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 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 0 ms 364 KB Output is correct
2 Correct 1 ms 368 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 344 ms 16940 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 512 ms 17056 KB Output is correct
3 Correct 463 ms 17020 KB Output is correct
4 Correct 455 ms 16976 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 512 ms 17056 KB Output is correct
3 Correct 463 ms 17020 KB Output is correct
4 Correct 455 ms 16976 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 475 ms 16880 KB Output is correct
7 Correct 467 ms 16976 KB Output is correct
8 Correct 463 ms 16848 KB Output is correct
9 Correct 515 ms 17244 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 512 ms 17056 KB Output is correct
3 Correct 463 ms 17020 KB Output is correct
4 Correct 455 ms 16976 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 46 ms 2536 KB Output is correct
7 Correct 49 ms 2536 KB Output is correct
8 Correct 47 ms 2536 KB Output is correct
9 Correct 47 ms 2844 KB Output is correct
10 Correct 45 ms 2536 KB Output is correct
11 Correct 47 ms 2536 KB Output is correct
12 Correct 44 ms 2536 KB Output is correct
13 Correct 48 ms 2536 KB Output is correct
14 Correct 56 ms 2536 KB Output is correct
15 Correct 54 ms 2536 KB Output is correct
16 Correct 49 ms 2536 KB Output is correct
17 Correct 48 ms 2536 KB Output is correct
18 Correct 472 ms 17008 KB Output is correct
19 Correct 461 ms 16848 KB Output is correct
20 Correct 525 ms 16848 KB Output is correct
21 Correct 51 ms 2664 KB Output is correct
22 Correct 43 ms 2536 KB Output is correct
23 Correct 142 ms 8668 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 51 ms 2664 KB Output is correct
3 Correct 49 ms 2536 KB Output is correct
4 Correct 549 ms 17048 KB Output is correct
5 Correct 49 ms 2536 KB Output is correct
6 Correct 49 ms 2536 KB Output is correct
7 Correct 49 ms 2536 KB Output is correct
8 Correct 52 ms 2536 KB Output is correct
9 Correct 51 ms 2536 KB Output is correct
10 Correct 49 ms 2536 KB Output is correct
11 Correct 50 ms 2536 KB Output is correct
12 Correct 43 ms 2536 KB Output is correct
13 Correct 50 ms 2536 KB Output is correct
14 Correct 525 ms 16960 KB Output is correct
15 Correct 49 ms 2536 KB Output is correct
16 Correct 464 ms 16848 KB Output is correct
17 Correct 457 ms 16848 KB Output is correct
18 Correct 1 ms 364 KB Output is correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 5 ms 748 KB Output is correct
3 Correct 5 ms 748 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 372 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 6 ms 748 KB Output is correct
17 Correct 53 ms 2536 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Incorrect 1 ms 364 KB Output isn't correct
21 Halted 0 ms 0 KB -