oj.uz

Submission #1115793

# Submission time Handle Problem Language Result Execution time Memory
1115793 2024-11-21T01:05:27 Z gdragon Strange Device (APIO19_strange_device) C++17
0 / 100
 5000 ms 405528 KB 
#include <bits/stdc++.h>
using namespace std;
#define TASK "long"
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define GETBIT(mask, i) ((mask) >> (i) & 1)
#define MASK(i) ((1LL) << (i))
#define SZ(x) ((int)(x).size())
#define mp make_pair
#define CNTBIT(mask) __builtin_popcount(mask)
template<class X, class Y> bool maximize(X &x, Y y){ if (x < y) {x = y; return true;} return false;};
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y) {x = y; return true;} return false;};
typedef pair<int, int> ii;
const int N = 1e6 + 5;
const int INF = 1e9 + 7;
const int mod = 1e9 + 7;
long long A, B;
int n;
pair<long long, long long> a[N];
void read() {
    cin >> n >> A >> B;
    for(int i = 1; i <= n; i++) cin >> a[i].fi >> a[i].se;
}
pair<long long, long long> cal(long long t) {
    // return mp(1, 1);
    return mp((t + (t / B)) % A, t % B);
}
void sub1() {
    map<pair<long long, long long>, bool> m;
    for(int i = 1; i <= n; i++) {
        for(int j = a[i].fi; j <= a[i].se; j++) {
            m[cal(j)] = 1;
        }
    }
    cout << SZ(m);
}
bool check1() {
    long long sum = 0;
    for(int i = 1; i <= n; i++) sum += (a[i].se - a[i].fi + 1);
    // cerr << sum << endl;
    return (sum <= (int)1e6);
}
void solve() {
    if (check1()) {
        sub1();
        return;
    }
    assert(false);
}
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    // if (fopen(TASK".inp", "r")) {
    //     freopen(TASK".inp", "r", stdin);
    //     freopen(TASK".out", "w", stdout);
    // }
    int test = 1;
    // cin >> test;
    while(test--) {
        read();
        solve();
    }
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Execution timed out 5117 ms 405528 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Runtime error 2 ms 592 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Execution timed out 5068 ms 60744 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Runtime error 237 ms 32116 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Runtime error 237 ms 32116 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Runtime error 237 ms 32116 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Runtime error 26 ms 4996 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Execution timed out 5117 ms 405528 KB Time limit exceeded
3 Halted 0 ms 0 KB -