oj.uz

Submission #641532

# Submission time Handle Problem Language Result Execution time Memory
641532 2022-09-17T02:24:08 Z baojiaopisu Strange Device (APIO19_strange_device) C++14
0 / 100
 5000 ms 524288 KB 
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 5e18;
const int N = 1e5 + 10;

ll gcd(ll x, ll y) {
    if(y == 0) return x;
    return gcd(y, x % y);
}

ll lcm(ll x, ll y) {
    ll ans = x / gcd(x, y);
    if(INF / ans < y) return -1;
    return ans * y;
}

map<ll, int> cnt;

void solve() {
	int n; ll A, B; cin >> n >> A >> B;
    ll m = 0;
    if(B % A == 0) {
        if(INF / A < B) m = -1;
        else m = A * B;
    } else {
        if((B + 1) % A == 0) m = B;
        else {
            if(INF / A < B) m = -1;
            else m = A * B;
        }   
    }

    if(m == -1) m = INF;

    ll ans = 0;
    for(int i = 1; i <= n; i++) {
        ll L, R; cin >> L >> R;
        for(ll j = L; j <= R; j++) {
            ll r = j % m;
            if(!cnt[r]) ++ans;
            cnt[r] = true;
        }
    }

    cout << ans;
}

int main()
{

    int tc = 1, ddd = 0;
    // cin >> tc;
    while(tc--) {
        //ddd++;
        //cout << "Case #" << ddd << ": ";
        solve();
    }
}

Compilation message

strange_device.cpp: In function 'int main()':
strange_device.cpp:115:17: warning: unused variable 'ddd' [-Wunused-variable]
  115 |     int tc = 1, ddd = 0;
      |                 ^~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 64 ms 12268 KB Output is correct
3 Correct 94 ms 17904 KB Output is correct
4 Incorrect 3 ms 980 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 4933 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 141 ms 32268 KB Output is correct
3 Correct 143 ms 32188 KB Output is correct
4 Correct 132 ms 30588 KB Output is correct
5 Execution timed out 5057 ms 62428 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1478 ms 63068 KB Output is correct
3 Runtime error 2566 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1478 ms 63068 KB Output is correct
3 Runtime error 2566 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1478 ms 63068 KB Output is correct
3 Runtime error 2566 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 2598 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 64 ms 12268 KB Output is correct
3 Correct 94 ms 17904 KB Output is correct
4 Incorrect 3 ms 980 KB Output isn't correct
5 Halted 0 ms 0 KB -