oj.uz

Submission #346637

# Submission time Handle Problem Language Result Execution time Memory
346637 2021-01-10T13:51:17 Z YJU Strange Device (APIO19_strange_device) C++14
65 / 100
 521 ms 17760 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,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((ld)a/g*b>1e18){
		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));
			v.pb(mp(0,y+1));
		}else{
			v.pb(mp(x,y+1));
		}
	}
	sort(v.begin(),v.end());
	for(auto i:v){
		ans+=max(0LL,i.Y-max(last,i.X));
		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 1132 KB Output is correct
3 Correct 5 ms 1132 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 1132 KB Output is correct
17 Correct 50 ms 3176 KB Output is correct
18 Correct 1 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 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 332 ms 17488 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 452 ms 17360 KB Output is correct
3 Correct 444 ms 17640 KB Output is correct
4 Correct 435 ms 17488 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 452 ms 17360 KB Output is correct
3 Correct 444 ms 17640 KB Output is correct
4 Correct 435 ms 17488 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 447 ms 17616 KB Output is correct
7 Correct 457 ms 17616 KB Output is correct
8 Correct 453 ms 17548 KB Output is correct
9 Correct 492 ms 17488 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 452 ms 17360 KB Output is correct
3 Correct 444 ms 17640 KB Output is correct
4 Correct 435 ms 17488 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 47 ms 3176 KB Output is correct
7 Correct 47 ms 3176 KB Output is correct
8 Correct 44 ms 3176 KB Output is correct
9 Correct 44 ms 3176 KB Output is correct
10 Correct 44 ms 3176 KB Output is correct
11 Correct 53 ms 3128 KB Output is correct
12 Correct 43 ms 3176 KB Output is correct
13 Correct 46 ms 3176 KB Output is correct
14 Correct 52 ms 3176 KB Output is correct
15 Correct 48 ms 3176 KB Output is correct
16 Correct 47 ms 3176 KB Output is correct
17 Correct 45 ms 3176 KB Output is correct
18 Correct 453 ms 17760 KB Output is correct
19 Correct 451 ms 17488 KB Output is correct
20 Correct 504 ms 17488 KB Output is correct
21 Correct 48 ms 3088 KB Output is correct
22 Correct 42 ms 3048 KB Output is correct
23 Correct 141 ms 9316 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 47 ms 2920 KB Output is correct
3 Correct 51 ms 3048 KB Output is correct
4 Correct 521 ms 17432 KB Output is correct
5 Correct 47 ms 3048 KB Output is correct
6 Correct 48 ms 3048 KB Output is correct
7 Correct 47 ms 3048 KB Output is correct
8 Correct 49 ms 3048 KB Output is correct
9 Correct 46 ms 3048 KB Output is correct
10 Correct 47 ms 3048 KB Output is correct
11 Correct 47 ms 2920 KB Output is correct
12 Correct 45 ms 2920 KB Output is correct
13 Correct 48 ms 2920 KB Output is correct
14 Correct 497 ms 17536 KB Output is correct
15 Correct 47 ms 2920 KB Output is correct
16 Correct 448 ms 17232 KB Output is correct
17 Correct 449 ms 17104 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 1132 KB Output is correct
3 Correct 5 ms 1132 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 5 ms 1132 KB Output is correct
17 Correct 50 ms 3176 KB Output is correct
18 Correct 1 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 -