oj.uz

Submission #381948

# Submission time Handle Problem Language Result Execution time Memory
381948 2021-03-26T07:30:16 Z NONAME Vepar (COCI21_vepar) C++17
70 / 70
 261 ms 14480 KB 
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, const T b) {a = min(a, b); return (a == b);}
template <typename T> inline bool chmax(T& a, const T b) {a = max(a, b); return (a == b);}

const int base = (int)(1e9 + 7);
const int man = (int)(1e7 + 10);

bool was[man];
vector <int> pr;

inline void cls() {}

int cnt(int x, int y) {
    return (x / y);
}

int get(int lft, int rgt, int x) {
    long long p = x;
    int ret = 0;
    while (p <= rgt) {
        ret += cnt(rgt, p) - cnt(lft - 1, p);
        p *= x;
    }
    return ret;
}

void solve() {
    cls();

    int a, b, c, d;
    cin >> a >> b >> c >> d;
    for (auto& i : pr) {
        int x = get(a, b, i);
        int y = get(c, d, i);
        if ((y - x) < 0) {
            cout << "NE\n";
            return;
        }
    }

    cout << "DA\n";
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//    int t = 1;
    #ifdef _LOCAL
        system("color a");
        freopen("in.txt", "r", stdin);
//        cin >> t;
    #endif

    for (int i = 2; i <= 1e7; ++i) {
        if (was[i]) {
            continue;
        }
        pr.push_back(i);
        if ((i * 1LL * i) <= 1e7) {
            for (int j = (i * i); j <= 1e7; j += i) {
                was[j] = true;
            }
        }
    }

    int t;
    cin >> t;
    while (t--) {
        solve();
    }
//    for (int i = 1; i <= t; ++i) {
//        cerr << "Case #" << i << ": \n";
//        solve();
//        cerr << "\n";
//    }

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 14308 KB Output is correct
2 Correct 134 ms 14308 KB Output is correct
3 Correct 145 ms 14308 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 14308 KB Output is correct
2 Correct 125 ms 14308 KB Output is correct
3 Correct 126 ms 14308 KB Output is correct
4 Correct 129 ms 14308 KB Output is correct
5 Correct 123 ms 14436 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 14308 KB Output is correct
2 Correct 128 ms 14308 KB Output is correct
3 Correct 115 ms 14436 KB Output is correct
4 Correct 120 ms 14468 KB Output is correct
5 Correct 120 ms 14308 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 14436 KB Output is correct
2 Correct 132 ms 14452 KB Output is correct
3 Correct 122 ms 14308 KB Output is correct
4 Correct 145 ms 14328 KB Output is correct
5 Correct 144 ms 14436 KB Output is correct
6 Correct 162 ms 14436 KB Output is correct
7 Correct 261 ms 14436 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 14436 KB Output is correct
2 Correct 127 ms 14308 KB Output is correct
3 Correct 138 ms 14308 KB Output is correct
4 Correct 131 ms 14308 KB Output is correct
5 Correct 137 ms 14308 KB Output is correct
6 Correct 193 ms 14360 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 14308 KB Output is correct
2 Correct 116 ms 14436 KB Output is correct
3 Correct 127 ms 14308 KB Output is correct
4 Correct 128 ms 14408 KB Output is correct
5 Correct 130 ms 14308 KB Output is correct
6 Correct 200 ms 14308 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 14308 KB Output is correct
2 Correct 126 ms 14328 KB Output is correct
3 Correct 130 ms 14436 KB Output is correct
4 Correct 131 ms 14308 KB Output is correct
5 Correct 134 ms 14308 KB Output is correct
6 Correct 190 ms 14308 KB Output is correct
7 Correct 252 ms 14480 KB Output is correct