oj.uz

Submission #139512

# Submission time Handle Problem Language Result Execution time Memory
139512 2019-07-31T23:23:47 Z eriksuenderhauf Strange Device (APIO19_strange_device) C++11
0 / 100
 3008 ms 17472 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const int MAXN = 1e6 + 5;
const double eps = 1e-9;

int main() {
	int n; ll a, b; scanf("%d %I64d %I64d", &n, &a, &b);
	ll k = a / __gcd(a,b+1), mx = 1, ans = 0;
	if (k > (INF+b-1) / b) mx = INF+1;
	else mx = k*b;
	vll act;
	for (int i = 0; i < n; i++) {
		ll l, r; scanf("%I64d %I64d", &l, &r);
		bool fl = (r-l+1 >= mx);
		if (fl) {
			act.pb(mp(0,mx-1));
			break;
		}
		l %= mx, r %= mx;
		if (l > r) {
			act.pb(mp(l,mx-1));
			act.pb(mp(0,r));
		} else {
			act.pb(mp(l,r));
		}
	}
	n = act.size();
	sort(act.begin(), act.end());
	for (int i = 0; i < n; i++) {
		int j = i;
		ll curmx = act[i].se;
		for (; j < n; j++) {
			if (curmx < act[j].fi)
				break;
			curmx = max(curmx, act[j].se);
		}
		ans += curmx - act[i].fi + 1;
		i = j-1;
	}
	prl(ans);
	return 0;
}

Compilation message

strange_device.cpp: In function 'int main()':
strange_device.cpp:39:52: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'll* {aka long long int*}' [-Wformat=]
  int n; ll a, b; scanf("%d %I64d %I64d", &n, &a, &b);
                                              ~~    ^
strange_device.cpp:39:52: warning: format '%d' expects argument of type 'int*', but argument 4 has type 'll* {aka long long int*}' [-Wformat=]
strange_device.cpp:45:39: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'll* {aka long long int*}' [-Wformat=]
   ll l, r; scanf("%I64d %I64d", &l, &r);
                                 ~~    ^
strange_device.cpp:45:39: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'll* {aka long long int*}' [-Wformat=]
strange_device.cpp:14:37: warning: format '%d' expects argument of type 'int', but argument 2 has type 'll {aka long long int}' [-Wformat=]
 #define prl(n) printf("%I64d\n", (n))
                                     ^
strange_device.cpp:72:2: note: in expansion of macro 'prl'
  prl(ans);
  ^~~
strange_device.cpp:39:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int n; ll a, b; scanf("%d %I64d %I64d", &n, &a, &b);
                  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
strange_device.cpp:45:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   ll l, r; scanf("%I64d %I64d", &l, &r);
            ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 32 ms 1096 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 5 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 3008 ms 17472 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 3008 ms 17472 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 3008 ms 17472 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 284 ms 3608 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 32 ms 1096 KB Output isn't correct
3 Halted 0 ms 0 KB -