oj.uz

Submission #781757

# Submission time Handle Problem Language Result Execution time Memory
781757 2023-07-13T10:36:58 Z christinelynn Strange Device (APIO19_strange_device) C++17
15 / 100
 248 ms 32464 KB 
#include <bits/stdc++.h>
using namespace std;

# define int long long
# define fir first
# define sec second
# define pb push_back

const int cnst = 2e5+5;
bool mutipletestcase = 0;
//bool debug = false;

int gcd(int a, int b) {return b ? gcd(b, a%b): a;}
int lcm(int a, int b) {return a/gcd(a, b)*b;}

void solve() {
    int n, a, b; cin >> n >> a >> b;

    pair<int, int> num[n+5];
    int length = 0;

    for(int i = 1; i<=n; i++) {
        int x, y; cin >> x >> y;
        length += y-x+1;
        num[i] = {x, y};
    }

    if(length <= 1e6) {
        set<pair<int, int>> st;
        for(int i = 1; i<=n; i++) {
            int x, y; x = num[i].fir, y = num[i].sec;
            for(int i = x; i<=y; i++) {
                st.insert({(i+i/b)%a, i%b});
            }
        }

        cout << st.size() << endl;
        return;
    }
    if(a*b <= 1e6) {
        int val = a*b;
        int ans = 0;
        int get[val*2+5];
        memset(get, 0, sizeof(get));

        for(int i = 1; i<=n; i++) {
            int x, y; x = num[i].fir, y = num[i].sec;
            int len = y-x+1;
            if(len >= a*b) ans = val;
            x %= val;
            y %= val;
            if(!y) y += val;
            if(!x) x += val;
            if(y < x) y += val;
            // cerr << x << " " << y << endl;
            get[x]+=1, get[y+1] -= 1;
        }

        if(ans == val) cout << ans << endl;
        else {
            bool yes[val+5];
            memset(yes, 0, sizeof(yes));

            for(int i = 1; i<=2*val; i++) {
                get[i] += get[i-1];
                // cerr << i << " " << get[i] << " " << endl;
                // if(get[i]) cerr << i << " ";
                if(get[i]) yes[i%val] = 1;
            }
            for(int i = 0; i<=val; i++) {
                if(yes[i]) ans++;
            }

            cout << ans << endl;
        }
        return;
    }

}

signed main() {
    ios_base::sync_with_stdio(false);
    int t = 1;
    if(mutipletestcase) cin >> t; 
    while(t--) solve();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 35 ms 12476 KB Output is correct
3 Correct 55 ms 18356 KB Output is correct
4 Correct 2 ms 852 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 448 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 7 ms 1104 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 33 ms 6932 KB Output is correct
16 Correct 21 ms 7124 KB Output is correct
17 Correct 46 ms 9180 KB Output is correct
18 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 5.0

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

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 116 ms 32168 KB Output is correct
3 Correct 148 ms 31956 KB Output is correct
4 Correct 93 ms 30552 KB Output is correct
5 Correct 207 ms 32464 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 248 ms 15956 KB Output isn't correct
3 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 Incorrect 248 ms 15956 KB Output isn't correct
3 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 Incorrect 248 ms 15956 KB Output isn't correct
3 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 Incorrect 23 ms 1876 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 35 ms 12476 KB Output is correct
3 Correct 55 ms 18356 KB Output is correct
4 Correct 2 ms 852 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 448 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 7 ms 1104 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 33 ms 6932 KB Output is correct
16 Correct 21 ms 7124 KB Output is correct
17 Correct 46 ms 9180 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Incorrect 0 ms 212 KB Output isn't correct
21 Halted 0 ms 0 KB -