oj.uz

Submission #135072

# Submission time Handle Problem Language Result Execution time Memory
135072 2019-07-23T15:25:18 Z ryansee Strange Device (APIO19_strange_device) C++14
100 / 100
 760 ms 35152 KB 
#define LOCAL
#include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define LLINF ((long long) 1e18)//1234567890987654321
#define INF 1234567890ll
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second	
#define db 0
#define EPS (1e-7)    //0.0000001 the value
#define PI (acos((ld)-1.0))
#define MAXN (1000006)
#define ll long long int 
#define ld long double
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
#define FOR(ii, ss, ee) for(ll ii = (ss); ii < (ll)(ee); ++ii)
#define space " "
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ((ll)x.size())
#define ph push
#define btinpct(x) __builtin_popcountll((x))
#define MSB(bm) ((bm==0)?-1:(63-__builtin_clzll((bm))))
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
typedef pair <ll, ll> pi;
typedef pair <ll, pi> spi;
typedef pair <pi, pi> dpi;
inline ll rand(ll x, ll y) { ++y; return (rng() % (y-x)) + x; } //inclusivesss
string to_string(char c) {string s(1,c);return s;}string to_string(bool b){return (b ? "true" : "false");}template <typename A, typename B>string to_string(pair<A, B> p) {return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}template <typename A>string to_string(A v) {bool first = true;string res = "{";for (const auto &x : v) {if (!first) {res += ", ";}first = false;res += to_string(x);}res += "}";return res;}void degug_out() { cerr << endl; }template <typename Head, typename... Tail>void degug_out(Head H, Tail... T) {cerr << " " << to_string(H);degug_out(T...);}inline ll gcd(ll a,ll b){if(a>b)swap(a,b);if(a==0)return b;return gcd(b%a,a);}
#ifdef LOCAL
// #define degug(...) cerr << "[" << #__VA_ARGS__ << "]:", degug_out(__VA_ARGS__)
#else
// #define degug(...) 663
#define cerr if(0)cout
#endif
ll n,A,B;
pi E[MAXN];
ll limit=1e18+5;
ll qmult(ll x,ll e) {
	if(e==0)return 0;
	ll half=qmult(x,e/2);
	half+=half; half=min(half,limit);
	if(e&1) half+=x; half=min(half,limit);
	return half;
}
int main()
{
	FAST
	cin>>n>>A>>B;
	// ll p=qmult(A/gcd(A,B+1),B);
	ll p=A/gcd(A,B+1)*B;
	unsigned long long int test=((unsigned long long int)A) / ((unsigned long long int)gcd(A,B+1)) * ((unsigned long long int)B);
	if(p<0) p=limit;
	FOR(i,0,n) cin>>E[i].f>>E[i].s; FOR(i,0,n) if(E[i].s-E[i].f+1>=p) { cout<<p<<'\n'; return 0; }
	vector<pi>pay;
	FOR(i,0,n) { ll a=E[i].f%p,b=E[i].s%p;
		if(a>b) pay.eb(a,p-1),pay.eb(0,b);
		else pay.eb(a,b);
	}
	sort(all(pay));
	ll px=-1; ll ans=0;
	for(auto i:pay) {
		if(px>=i.f) ans+=max(0ll,i.s-px);
		else ans+=i.s-i.f+1;
		px=max(px,i.s);
	}
	cout<<ans<<'\n';
}

Compilation message

strange_device.cpp: In function 'long long int qmult(long long int, long long int)':
strange_device.cpp:48:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if(e&1) half+=x; half=min(half,limit);
  ^~
strange_device.cpp:48:19: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if(e&1) half+=x; half=min(half,limit);
                   ^~~~
strange_device.cpp: In function 'int main()':
strange_device.cpp:57:25: warning: unused variable 'test' [-Wunused-variable]
  unsigned long long int test=((unsigned long long int)A) / ((unsigned long long int)gcd(A,B+1)) * ((unsigned long long int)B);
                         ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 9 ms 1272 KB Output is correct
3 Correct 8 ms 1272 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 8 ms 1272 KB Output is correct
17 Correct 70 ms 6588 KB Output is correct
18 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 300 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 3 ms 432 KB Output is correct
5 Correct 465 ms 35152 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 623 ms 35128 KB Output is correct
3 Correct 622 ms 33956 KB Output is correct
4 Correct 657 ms 33976 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 623 ms 35128 KB Output is correct
3 Correct 622 ms 33956 KB Output is correct
4 Correct 657 ms 33976 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 646 ms 33920 KB Output is correct
7 Correct 624 ms 33956 KB Output is correct
8 Correct 623 ms 33984 KB Output is correct
9 Correct 745 ms 33956 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 623 ms 35128 KB Output is correct
3 Correct 622 ms 33956 KB Output is correct
4 Correct 657 ms 33976 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 64 ms 6236 KB Output is correct
7 Correct 69 ms 6488 KB Output is correct
8 Correct 66 ms 6504 KB Output is correct
9 Correct 67 ms 6636 KB Output is correct
10 Correct 66 ms 7172 KB Output is correct
11 Correct 67 ms 7176 KB Output is correct
12 Correct 64 ms 7204 KB Output is correct
13 Correct 70 ms 7140 KB Output is correct
14 Correct 63 ms 7168 KB Output is correct
15 Correct 72 ms 7324 KB Output is correct
16 Correct 69 ms 7164 KB Output is correct
17 Correct 66 ms 7276 KB Output is correct
18 Correct 631 ms 34000 KB Output is correct
19 Correct 623 ms 34044 KB Output is correct
20 Correct 702 ms 34088 KB Output is correct
21 Correct 69 ms 6044 KB Output is correct
22 Correct 62 ms 7152 KB Output is correct
23 Correct 206 ms 18580 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 70 ms 7200 KB Output is correct
3 Correct 69 ms 7396 KB Output is correct
4 Correct 752 ms 34112 KB Output is correct
5 Correct 61 ms 7152 KB Output is correct
6 Correct 69 ms 7180 KB Output is correct
7 Correct 70 ms 7060 KB Output is correct
8 Correct 71 ms 7056 KB Output is correct
9 Correct 69 ms 7024 KB Output is correct
10 Correct 81 ms 7020 KB Output is correct
11 Correct 71 ms 6912 KB Output is correct
12 Correct 63 ms 6896 KB Output is correct
13 Correct 70 ms 6928 KB Output is correct
14 Correct 674 ms 33996 KB Output is correct
15 Correct 68 ms 6764 KB Output is correct
16 Correct 618 ms 33968 KB Output is correct
17 Correct 612 ms 34044 KB Output is correct
18 Correct 2 ms 376 KB Output is correct

Subtask #8
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 9 ms 1272 KB Output is correct
3 Correct 8 ms 1272 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 8 ms 1272 KB Output is correct
17 Correct 70 ms 6588 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 300 KB Output is correct
20 Correct 2 ms 356 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 380 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 504 KB Output is correct
27 Correct 3 ms 432 KB Output is correct
28 Correct 465 ms 35152 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 623 ms 35128 KB Output is correct
31 Correct 622 ms 33956 KB Output is correct
32 Correct 657 ms 33976 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 646 ms 33920 KB Output is correct
35 Correct 624 ms 33956 KB Output is correct
36 Correct 623 ms 33984 KB Output is correct
37 Correct 745 ms 33956 KB Output is correct
38 Correct 3 ms 376 KB Output is correct
39 Correct 64 ms 6236 KB Output is correct
40 Correct 69 ms 6488 KB Output is correct
41 Correct 66 ms 6504 KB Output is correct
42 Correct 67 ms 6636 KB Output is correct
43 Correct 66 ms 7172 KB Output is correct
44 Correct 67 ms 7176 KB Output is correct
45 Correct 64 ms 7204 KB Output is correct
46 Correct 70 ms 7140 KB Output is correct
47 Correct 63 ms 7168 KB Output is correct
48 Correct 72 ms 7324 KB Output is correct
49 Correct 69 ms 7164 KB Output is correct
50 Correct 66 ms 7276 KB Output is correct
51 Correct 631 ms 34000 KB Output is correct
52 Correct 623 ms 34044 KB Output is correct
53 Correct 702 ms 34088 KB Output is correct
54 Correct 69 ms 6044 KB Output is correct
55 Correct 62 ms 7152 KB Output is correct
56 Correct 206 ms 18580 KB Output is correct
57 Correct 2 ms 376 KB Output is correct
58 Correct 70 ms 7200 KB Output is correct
59 Correct 69 ms 7396 KB Output is correct
60 Correct 752 ms 34112 KB Output is correct
61 Correct 61 ms 7152 KB Output is correct
62 Correct 69 ms 7180 KB Output is correct
63 Correct 70 ms 7060 KB Output is correct
64 Correct 71 ms 7056 KB Output is correct
65 Correct 69 ms 7024 KB Output is correct
66 Correct 81 ms 7020 KB Output is correct
67 Correct 71 ms 6912 KB Output is correct
68 Correct 63 ms 6896 KB Output is correct
69 Correct 70 ms 6928 KB Output is correct
70 Correct 674 ms 33996 KB Output is correct
71 Correct 68 ms 6764 KB Output is correct
72 Correct 618 ms 33968 KB Output is correct
73 Correct 612 ms 34044 KB Output is correct
74 Correct 2 ms 376 KB Output is correct
75 Correct 2 ms 376 KB Output is correct
76 Correct 2 ms 376 KB Output is correct
77 Correct 2 ms 424 KB Output is correct
78 Correct 2 ms 376 KB Output is correct
79 Correct 9 ms 1312 KB Output is correct
80 Correct 760 ms 33732 KB Output is correct
81 Correct 699 ms 33896 KB Output is correct
82 Correct 677 ms 33860 KB Output is correct
83 Correct 679 ms 33848 KB Output is correct
84 Correct 682 ms 33832 KB Output is correct
85 Correct 677 ms 33756 KB Output is correct
86 Correct 198 ms 16404 KB Output is correct
87 Correct 2 ms 376 KB Output is correct