oj.uz

Submission #265777

# Submission time Handle Problem Language Result Execution time Memory
265777 2020-08-15T04:45:30 Z kaage Strange Device (APIO19_strange_device) C++17
100 / 100
 643 ms 69856 KB 
#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx2")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define all(V) V.begin(),V.end()
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
typedef std::pair<lint, lint> LP;
constexpr int INF = INT_MAX/2;
constexpr lint LINF = LLONG_MAX/2;
constexpr double eps = DBL_EPSILON;
constexpr double PI=3.141592653589793238462643383279;
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
	if (lhs < rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
	if (lhs > rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
inline lint gcd(lint a, lint b) {
	while (b) {
		lint c = a;
		a = b; b = c % b;
	}
	return a;
}
inline lint lcm(lint a, lint b) {
	return a / gcd(a, b) * b;
}
bool isprime(lint n) {
	if (n == 1)return false;
	for (int i = 2; i * i <= n; i++) {
		if (n % i == 0)return false;
	}
	return true;
}
template<typename T>
T mypow(T a, lint b) {
	T res(1);
	while(b){
		if(b&1)res*=a;
		a*=a;
		b>>=1;
	}
	return res;
}
lint modpow(lint a, lint b, lint m) {
	lint res(1);
	while(b){
		if(b&1){
			res*=a;res%=m;
		}
		a*=a;a%=m;
		b>>=1;
	}
	return res;
}
template<typename T>
void printArray(std::vector<T>& vec) {
	rep(i, vec.size()){
		std::cout << vec[i];
		std::cout<<(i==(int)vec.size()-1?"\n":" ");
	}
}
template<typename T>
void printArray(T l, T r) {
	T rprev = std::prev(r);
	for (T i = l; i != rprev; i++) {
		std::cout << *i << " ";
	}
	std::cout << *rprev << std::endl;
}
LP extGcd(lint a,lint b) {
	if(b==0)return {1,0};
	LP s=extGcd(b,a%b);
	std::swap(s.first,s.second);
	s.second-=a/b*s.first;
	return s;
}
LP ChineseRem(const lint& b1,const lint& m1,const lint& b2,const lint& m2) {
	lint p=extGcd(m1,m2).first;
	lint tmp=(b2-b1)*p%m2;
	lint r=(b1+m1*tmp+m1*m2)%(m1*m2);
	return std::make_pair(r,m1*m2);
}
/*template<typename F>
inline constexpr decltype(auto) lambda_fix(F&& f){
	return [f=std::forward<F>(f)](auto&&... args){
		return f(f,std::forward<decltype(args)>(args)...);
	};
}*/
#line 2 "main.cpp"
int n;
lint a,b,l[1000010],r[1000010];
int main(){
	scanf("%d%lld%lld",&n,&a,&b);
	rep(i,n)scanf("%lld%lld",l+i,r+i);
	lint tmp=a/gcd(b+1,a);
	if(1000000000000000001/b<=tmp){
		lint ans=0;
		rep(i,n)ans+=r[i]-l[i]+1;
		printf("%lld\n",ans);
		return 0;
	}
	lint per=tmp*b;
	std::vector<LP> vec;
	rep(i,n){
		if(r[i]-l[i]+1>=per){
			printf("%lld\n",per);
			return 0;
		}
		if(l[i]/per!=r[i]/per){
			vec.emplace_back(l[i]%per,per);
			vec.emplace_back(0,r[i]%per+1);
		}
		else vec.emplace_back(l[i]%per,r[i]%per+1);
	}
	std::sort(all(vec));
	lint nowlast=-1,ans=0;
	for(const LP& p:vec){
		if(nowlast<p.first){
			ans+=p.second-p.first;
			nowlast=p.second;
		}
		else if(nowlast<p.second){
			ans+=p.second-nowlast;
			nowlast=p.second;
		}
	}
	printf("%lld\n",ans);
}

Compilation message

/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:3: warning: ignoring #pragma target  [-Wunknown-pragmas]
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:4: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:5: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
main.cpp: In function 'int main()':
main.cpp:5:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
main.cpp:6:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 6 ms 896 KB Output is correct
3 Correct 6 ms 1408 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 1280 KB Output is correct
17 Correct 61 ms 7784 KB Output is correct
18 Correct 1 ms 384 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 437 ms 49500 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 562 ms 32604 KB Output is correct
3 Correct 546 ms 32616 KB Output is correct
4 Correct 547 ms 32476 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 562 ms 32604 KB Output is correct
3 Correct 546 ms 32616 KB Output is correct
4 Correct 547 ms 32476 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 574 ms 32500 KB Output is correct
7 Correct 562 ms 32604 KB Output is correct
8 Correct 570 ms 32688 KB Output is correct
9 Correct 573 ms 32608 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 562 ms 32604 KB Output is correct
3 Correct 546 ms 32616 KB Output is correct
4 Correct 547 ms 32476 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 54 ms 4076 KB Output is correct
7 Correct 57 ms 4076 KB Output is correct
8 Correct 53 ms 4088 KB Output is correct
9 Correct 56 ms 4076 KB Output is correct
10 Correct 55 ms 4080 KB Output is correct
11 Correct 58 ms 4108 KB Output is correct
12 Correct 53 ms 4076 KB Output is correct
13 Correct 56 ms 4076 KB Output is correct
14 Correct 54 ms 4116 KB Output is correct
15 Correct 58 ms 4076 KB Output is correct
16 Correct 58 ms 7788 KB Output is correct
17 Correct 56 ms 7780 KB Output is correct
18 Correct 566 ms 41692 KB Output is correct
19 Correct 535 ms 61408 KB Output is correct
20 Correct 603 ms 60384 KB Output is correct
21 Correct 61 ms 7916 KB Output is correct
22 Correct 52 ms 7788 KB Output is correct
23 Correct 244 ms 26596 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 68 ms 4076 KB Output is correct
3 Correct 56 ms 4076 KB Output is correct
4 Correct 641 ms 32608 KB Output is correct
5 Correct 70 ms 4076 KB Output is correct
6 Correct 62 ms 4076 KB Output is correct
7 Correct 55 ms 4076 KB Output is correct
8 Correct 59 ms 4076 KB Output is correct
9 Correct 55 ms 4076 KB Output is correct
10 Correct 56 ms 4076 KB Output is correct
11 Correct 56 ms 4076 KB Output is correct
12 Correct 51 ms 4076 KB Output is correct
13 Correct 57 ms 4076 KB Output is correct
14 Correct 608 ms 32608 KB Output is correct
15 Correct 59 ms 7792 KB Output is correct
16 Correct 580 ms 69856 KB Output is correct
17 Correct 555 ms 43616 KB Output is correct
18 Correct 1 ms 384 KB Output is correct

Subtask #8
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 6 ms 896 KB Output is correct
3 Correct 6 ms 1408 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 6 ms 1280 KB Output is correct
17 Correct 61 ms 7784 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 0 ms 256 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 437 ms 49500 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 562 ms 32604 KB Output is correct
31 Correct 546 ms 32616 KB Output is correct
32 Correct 547 ms 32476 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 574 ms 32500 KB Output is correct
35 Correct 562 ms 32604 KB Output is correct
36 Correct 570 ms 32688 KB Output is correct
37 Correct 573 ms 32608 KB Output is correct
38 Correct 0 ms 256 KB Output is correct
39 Correct 54 ms 4076 KB Output is correct
40 Correct 57 ms 4076 KB Output is correct
41 Correct 53 ms 4088 KB Output is correct
42 Correct 56 ms 4076 KB Output is correct
43 Correct 55 ms 4080 KB Output is correct
44 Correct 58 ms 4108 KB Output is correct
45 Correct 53 ms 4076 KB Output is correct
46 Correct 56 ms 4076 KB Output is correct
47 Correct 54 ms 4116 KB Output is correct
48 Correct 58 ms 4076 KB Output is correct
49 Correct 58 ms 7788 KB Output is correct
50 Correct 56 ms 7780 KB Output is correct
51 Correct 566 ms 41692 KB Output is correct
52 Correct 535 ms 61408 KB Output is correct
53 Correct 603 ms 60384 KB Output is correct
54 Correct 61 ms 7916 KB Output is correct
55 Correct 52 ms 7788 KB Output is correct
56 Correct 244 ms 26596 KB Output is correct
57 Correct 0 ms 256 KB Output is correct
58 Correct 68 ms 4076 KB Output is correct
59 Correct 56 ms 4076 KB Output is correct
60 Correct 641 ms 32608 KB Output is correct
61 Correct 70 ms 4076 KB Output is correct
62 Correct 62 ms 4076 KB Output is correct
63 Correct 55 ms 4076 KB Output is correct
64 Correct 59 ms 4076 KB Output is correct
65 Correct 55 ms 4076 KB Output is correct
66 Correct 56 ms 4076 KB Output is correct
67 Correct 56 ms 4076 KB Output is correct
68 Correct 51 ms 4076 KB Output is correct
69 Correct 57 ms 4076 KB Output is correct
70 Correct 608 ms 32608 KB Output is correct
71 Correct 59 ms 7792 KB Output is correct
72 Correct 580 ms 69856 KB Output is correct
73 Correct 555 ms 43616 KB Output is correct
74 Correct 1 ms 384 KB Output is correct
75 Correct 0 ms 384 KB Output is correct
76 Correct 0 ms 384 KB Output is correct
77 Correct 0 ms 384 KB Output is correct
78 Correct 0 ms 384 KB Output is correct
79 Correct 6 ms 1280 KB Output is correct
80 Correct 625 ms 45404 KB Output is correct
81 Correct 602 ms 41820 KB Output is correct
82 Correct 591 ms 44256 KB Output is correct
83 Correct 597 ms 47624 KB Output is correct
84 Correct 589 ms 49556 KB Output is correct
85 Correct 643 ms 51160 KB Output is correct
86 Correct 210 ms 26472 KB Output is correct
87 Correct 1 ms 384 KB Output is correct