oj.uz

Submission #438724

# Submission time Handle Problem Language Result Execution time Memory
438724 2021-06-28T14:25:18 Z SorahISA Vepar (COCI21_vepar) C++17
70 / 70
 177 ms 9984 KB 
// #pragma GCC optimize("Ofast", "unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back
#define fastIO() ios_base::sync_with_stdio(false), cin.tie(0)

const int maxc = 1E7;

vector<int> primes;
bitset<maxc> isprime;

void init() {
    isprime.set();
    isprime[0] = 0, isprime[1] = 0;
    for (int i = 2, j = i; i <= maxc; j = ++i) {
        if (isprime[i]) {
            while ((j += i) <= maxc) isprime[j] = 0;
            primes.eb(i);
        }
    }
}

void solve() {
    auto cnt_fac = [](int x, int p, int ans = 0) {
        while (x >= p) ans += x /= p;
        return ans;
    };
    
    int a, b, c, d; cin >> a >> b >> c >> d;
    for (auto p : primes) {
        if (cnt_fac(b, p) - cnt_fac(a-1, p) > cnt_fac(d, p) - cnt_fac(c-1, p)) {
            cout << "NE\n"; return;
        }
    }
    cout << "DA\n";
}

int32_t main() {
    fastIO();
    init();
    
    int t = 1; cin >> t;
    while (t--) solve();
    
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 9820 KB Output is correct
2 Correct 129 ms 9824 KB Output is correct
3 Correct 102 ms 9824 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 9820 KB Output is correct
2 Correct 116 ms 9776 KB Output is correct
3 Correct 114 ms 9824 KB Output is correct
4 Correct 116 ms 9780 KB Output is correct
5 Correct 112 ms 9832 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 9824 KB Output is correct
2 Correct 112 ms 9776 KB Output is correct
3 Correct 112 ms 9828 KB Output is correct
4 Correct 112 ms 9824 KB Output is correct
5 Correct 117 ms 9804 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 9800 KB Output is correct
2 Correct 118 ms 9812 KB Output is correct
3 Correct 109 ms 9780 KB Output is correct
4 Correct 127 ms 9952 KB Output is correct
5 Correct 122 ms 9812 KB Output is correct
6 Correct 128 ms 9908 KB Output is correct
7 Correct 177 ms 9828 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 9848 KB Output is correct
2 Correct 107 ms 9828 KB Output is correct
3 Correct 120 ms 9788 KB Output is correct
4 Correct 120 ms 9828 KB Output is correct
5 Correct 117 ms 9784 KB Output is correct
6 Correct 156 ms 9828 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 9984 KB Output is correct
2 Correct 107 ms 9808 KB Output is correct
3 Correct 122 ms 9872 KB Output is correct
4 Correct 114 ms 9828 KB Output is correct
5 Correct 119 ms 9820 KB Output is correct
6 Correct 158 ms 9828 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 9824 KB Output is correct
2 Correct 114 ms 9784 KB Output is correct
3 Correct 114 ms 9816 KB Output is correct
4 Correct 124 ms 9780 KB Output is correct
5 Correct 124 ms 9764 KB Output is correct
6 Correct 156 ms 9832 KB Output is correct
7 Correct 174 ms 9780 KB Output is correct