oj.uz

Submission #683289

# Submission time Handle Problem Language Result Execution time Memory
683289 2023-01-18T06:16:20 Z Nursik Strange Device (APIO19_strange_device) C++14
10 / 100
 5000 ms 504760 KB 
#include <stdio.h>
 
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;
 
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ld long double
#define bug cout << "bug\n";

const ll maxn = 1e6 + 1, maxm = 2e2 + 1;
const ll mod = 1e9 + 7, inf = 1e9, block = 550, hb = 126067, base = 1000050017,
         biginf = 5e18;
const ld eps = 1e-15;
using namespace std;

ll n, a, b;
ll l[maxn], r[maxn];
ll sum = 0;
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n >> a >> b;
    for (int i = 1; i <= n; ++i){
        cin >> l[i] >> r[i];
        sum += (r[i] - l[i] + 1);
    }
    if (sum <= 1e6){
        set<pair<ll, ll>> setik;
        for (int i = 1; i <= n; ++i){
            for (ll j = l[i]; j <= r[i]; ++j){
                ll x = (j + j / b) % a;
                ll y = j % b;
                setik.insert(mp(x, y));
            }
        }
        int sz = (int)setik.size();
        cout << sz;
        exit(0);
    }
    if (n == 1){
        set<pair<ll, ll>> setik;
        for (int i = 1; i <= n; ++i){
            for (ll j = l[i]; j <= r[i]; ++j){
                ll x = (j + j / b) % a;
                ll y = j % b;
                if (setik.find(mp(x, y)) != setik.end())
                    break;
                setik.insert(mp(x, y));
            }
        }
        cout << setik.size();
    }
}
/*
 */

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 12776 KB Output is correct
3 Correct 52 ms 18384 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 456 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 7 ms 1236 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 38 ms 6952 KB Output is correct
16 Correct 20 ms 7252 KB Output is correct
17 Correct 50 ms 11852 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 0 ms 212 KB Output is correct
2 Execution timed out 5084 ms 504760 KB Time limit exceeded
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 93 ms 32308 KB Output is correct
3 Correct 99 ms 32144 KB Output is correct
4 Correct 91 ms 30568 KB Output is correct
5 Incorrect 244 ms 41164 KB Output isn't correct
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 Incorrect 306 ms 15904 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 306 ms 15904 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 306 ms 15904 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 39 ms 5416 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 12776 KB Output is correct
3 Correct 52 ms 18384 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 456 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 7 ms 1236 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 38 ms 6952 KB Output is correct
16 Correct 20 ms 7252 KB Output is correct
17 Correct 50 ms 11852 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Execution timed out 5084 ms 504760 KB Time limit exceeded
21 Halted 0 ms 0 KB -