oj.uz

Submission #314411

# Submission time Handle Problem Language Result Execution time Memory
314411 2020-10-19T20:06:25 Z AmineWeslati Strange Device (APIO19_strange_device) C++14
100 / 100
 562 ms 78076 KB 
//Never stop trying
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

#define dbg(x) cerr << " - " << #x << " : " << x << endl;
#define dbgs(x,y) cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << " - " << #v << " : " << endl << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;

void IO() {
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
}

#define ull unsigned ll

ll N,A,B;


ll determine(){
	ll x=A/(__gcd(A,(B+1)%A));
	ll y=B;
	if(log10(x)+log10(y)>18.7) return -1;
	//cout << x << ' ' << log10(x) << endl;
	return x*y;
}

pair<ll,ll> inter(pair<ll,ll> a, pair<ll,ll> b){
	if(a.fi==-1ll) return b;
	if(b.se<a.fi || a.se<b.fi) return {-1ll,-1ll};
	return {min(a.fi,b.fi),max(a.se,b.se)};
}



int main() {
	boost; 

	cin>>N>>A>>B;

	ll X=determine();

	V<pair<ll,ll>> vec;

	set<pair<ll,ll>> s;

	FOR(i,0,N){
		ll l,r;
		cin>>l>>r;

		/*FOR(i,l,r+1){
			s.insert({(i+i/B)%A,i%B});
		}*/

		
		if(X==-1) vec.pb({l,r});
		else{
			if(r-l+1>=X) vec.pb({0,X-1});
			else{
				l%=X; r%=X;
				if(l<=r) vec.pb({l,r});
				else vec.pb({l,X-1}),vec.pb({0,r});
			}
		}
	}

	sort(all(vec));

	V<pair<ll,ll>> res;

	ll l=-1,r=-1;

	FOR(i,0,sz(vec)){
		pair<ll,ll> p=inter({l,r},{vec[i].fi,vec[i].se});
		if(p.fi!=-1){
			l=p.fi; r=p.se;
		}
		else{
			res.pb({l,r});
			l=vec[i].fi,r=vec[i].se;
		}
	}
	res.pb({l,r});

	ll ans=0;
	for(auto x: res) ans+=x.se-x.fi+1;
	cout << ans << endl;
	//cout << sz(s) << endl;




	return 0;
}

/* Careful!!!
	.Array bounds
	.Infinite loops
	.Uninitialized variables / empty containers
	.Order of input

   Some insights:
	.Binary search
	.Graph representation
	.Write brute force code
	.Change your approach
*/

Compilation message

strange_device.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("O3")
      | 
strange_device.cpp:4: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("unroll-loops")
      | 
strange_device.cpp: In function 'void IO()':
strange_device.cpp:49:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   49 |  freopen("input.txt", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
strange_device.cpp:50:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   50 |  freopen("output.txt", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 5 ms 1280 KB Output is correct
3 Correct 6 ms 1280 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 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 1 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 5 ms 1280 KB Output is correct
17 Correct 53 ms 8680 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 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 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 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 347 ms 41572 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 499 ms 77824 KB Output is correct
3 Correct 497 ms 77896 KB Output is correct
4 Correct 482 ms 77892 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 499 ms 77824 KB Output is correct
3 Correct 497 ms 77896 KB Output is correct
4 Correct 482 ms 77892 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 483 ms 77924 KB Output is correct
7 Correct 499 ms 77888 KB Output is correct
8 Correct 483 ms 78076 KB Output is correct
9 Correct 528 ms 77912 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 499 ms 77824 KB Output is correct
3 Correct 497 ms 77896 KB Output is correct
4 Correct 482 ms 77892 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 48 ms 8680 KB Output is correct
7 Correct 50 ms 8684 KB Output is correct
8 Correct 49 ms 8812 KB Output is correct
9 Correct 48 ms 8812 KB Output is correct
10 Correct 48 ms 8712 KB Output is correct
11 Correct 49 ms 8680 KB Output is correct
12 Correct 49 ms 8760 KB Output is correct
13 Correct 51 ms 8680 KB Output is correct
14 Correct 48 ms 8680 KB Output is correct
15 Correct 53 ms 8684 KB Output is correct
16 Correct 54 ms 8680 KB Output is correct
17 Correct 49 ms 8684 KB Output is correct
18 Correct 500 ms 77888 KB Output is correct
19 Correct 476 ms 78032 KB Output is correct
20 Correct 531 ms 77892 KB Output is correct
21 Correct 52 ms 8680 KB Output is correct
22 Correct 47 ms 8684 KB Output is correct
23 Correct 144 ms 18672 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 51 ms 8676 KB Output is correct
3 Correct 52 ms 8684 KB Output is correct
4 Correct 560 ms 78016 KB Output is correct
5 Correct 50 ms 8684 KB Output is correct
6 Correct 54 ms 8684 KB Output is correct
7 Correct 50 ms 8684 KB Output is correct
8 Correct 52 ms 8684 KB Output is correct
9 Correct 53 ms 8680 KB Output is correct
10 Correct 51 ms 8684 KB Output is correct
11 Correct 52 ms 8684 KB Output is correct
12 Correct 47 ms 8680 KB Output is correct
13 Correct 52 ms 8788 KB Output is correct
14 Correct 527 ms 77872 KB Output is correct
15 Correct 50 ms 8680 KB Output is correct
16 Correct 487 ms 78016 KB Output is correct
17 Correct 484 ms 77888 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 0 ms 384 KB Output is correct
2 Correct 5 ms 1280 KB Output is correct
3 Correct 6 ms 1280 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 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 1 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 5 ms 1280 KB Output is correct
17 Correct 53 ms 8680 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 347 ms 41572 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 499 ms 77824 KB Output is correct
31 Correct 497 ms 77896 KB Output is correct
32 Correct 482 ms 77892 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 483 ms 77924 KB Output is correct
35 Correct 499 ms 77888 KB Output is correct
36 Correct 483 ms 78076 KB Output is correct
37 Correct 528 ms 77912 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 48 ms 8680 KB Output is correct
40 Correct 50 ms 8684 KB Output is correct
41 Correct 49 ms 8812 KB Output is correct
42 Correct 48 ms 8812 KB Output is correct
43 Correct 48 ms 8712 KB Output is correct
44 Correct 49 ms 8680 KB Output is correct
45 Correct 49 ms 8760 KB Output is correct
46 Correct 51 ms 8680 KB Output is correct
47 Correct 48 ms 8680 KB Output is correct
48 Correct 53 ms 8684 KB Output is correct
49 Correct 54 ms 8680 KB Output is correct
50 Correct 49 ms 8684 KB Output is correct
51 Correct 500 ms 77888 KB Output is correct
52 Correct 476 ms 78032 KB Output is correct
53 Correct 531 ms 77892 KB Output is correct
54 Correct 52 ms 8680 KB Output is correct
55 Correct 47 ms 8684 KB Output is correct
56 Correct 144 ms 18672 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 51 ms 8676 KB Output is correct
59 Correct 52 ms 8684 KB Output is correct
60 Correct 560 ms 78016 KB Output is correct
61 Correct 50 ms 8684 KB Output is correct
62 Correct 54 ms 8684 KB Output is correct
63 Correct 50 ms 8684 KB Output is correct
64 Correct 52 ms 8684 KB Output is correct
65 Correct 53 ms 8680 KB Output is correct
66 Correct 51 ms 8684 KB Output is correct
67 Correct 52 ms 8684 KB Output is correct
68 Correct 47 ms 8680 KB Output is correct
69 Correct 52 ms 8788 KB Output is correct
70 Correct 527 ms 77872 KB Output is correct
71 Correct 50 ms 8680 KB Output is correct
72 Correct 487 ms 78016 KB Output is correct
73 Correct 484 ms 77888 KB Output is correct
74 Correct 1 ms 384 KB Output is correct
75 Correct 1 ms 384 KB Output is correct
76 Correct 0 ms 384 KB Output is correct
77 Correct 1 ms 384 KB Output is correct
78 Correct 1 ms 384 KB Output is correct
79 Correct 5 ms 1280 KB Output is correct
80 Correct 560 ms 77944 KB Output is correct
81 Correct 562 ms 77888 KB Output is correct
82 Correct 517 ms 78020 KB Output is correct
83 Correct 519 ms 77888 KB Output is correct
84 Correct 525 ms 78024 KB Output is correct
85 Correct 524 ms 77884 KB Output is correct
86 Correct 143 ms 18528 KB Output is correct
87 Correct 1 ms 384 KB Output is correct