oj.uz

Submission #497974

# Submission time Handle Problem Language Result Execution time Memory
497974 2021-12-24T07:13:05 Z abc864197532 Vepar (COCI21_vepar) C++17
70 / 70
 503 ms 78656 KB 
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.X >> a.Y;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.X << ", " << a.Y << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    if (a.empty())
        return o << "{}";
    bool is = false;
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}
template <typename T> struct vv : vector <vector <T>> {
    vv(int n, int m, T v) : vector <vector <T>> (n, vector <T>(m, v)) {}
    vv() {}
};
template <typename T> struct vvv : vector <vv <T>> {
    vvv(int n, int m, int k, T v) : vector <vv <T>> (n, vv <T>(m, k, v)) {}
    vvv() {}
};
#ifdef Doludu
#define test(args...) abc("[" + string(#args) + "]", args)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#else
#define test(args...) void(0)
#define owo ios::sync_with_stdio(false); cin.tie(0)
#endif
const int mod = 1e9 + 7, N = 10000010, logN = 17, M = N * 40;

int lp[N], cur[N];

int main () {
    owo;
    iota(lp, lp + N, 0);
    for (int i = 2; i < N; ++i) if (lp[i] == i) {
        for (int j = i + i; j < N; j += i) if (lp[j] == j) {
            lp[j] = i;
        }
    }
    int t;
    cin >> t;
    while (t--) {
        fill(cur, cur + N, 0);
        int a, b, c, d;
        cin >> a >> b >> c >> d, --a, --c;
        for (int i = 2; i < N; ++i) if (lp[i] == i) {
            lli now = i;
            while (now < N) {
                cur[i] -= b / now - a / now;
                cur[i] += d / now - c / now;
                now *= i;
            }
        }
        bool is = true;
        for (int i = 2; i < N; ++i) if (cur[i] < 0) {
            is = false;
            break;
        }
        cout << (is ? "DA\n" : "NE\n");
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 394 ms 78532 KB Output is correct
2 Correct 503 ms 78488 KB Output is correct
3 Correct 438 ms 78568 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 78568 KB Output is correct
2 Correct 444 ms 78572 KB Output is correct
3 Correct 399 ms 78480 KB Output is correct
4 Correct 415 ms 78472 KB Output is correct
5 Correct 432 ms 78476 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 390 ms 78624 KB Output is correct
2 Correct 409 ms 78568 KB Output is correct
3 Correct 422 ms 78480 KB Output is correct
4 Correct 390 ms 78532 KB Output is correct
5 Correct 429 ms 78464 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 423 ms 78572 KB Output is correct
2 Correct 489 ms 78484 KB Output is correct
3 Correct 415 ms 78476 KB Output is correct
4 Correct 425 ms 78480 KB Output is correct
5 Correct 439 ms 78568 KB Output is correct
6 Correct 342 ms 78580 KB Output is correct
7 Correct 431 ms 78472 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 458 ms 78480 KB Output is correct
2 Correct 406 ms 78564 KB Output is correct
3 Correct 409 ms 78488 KB Output is correct
4 Correct 448 ms 78568 KB Output is correct
5 Correct 399 ms 78488 KB Output is correct
6 Correct 454 ms 78572 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 430 ms 78564 KB Output is correct
2 Correct 392 ms 78564 KB Output is correct
3 Correct 406 ms 78572 KB Output is correct
4 Correct 399 ms 78564 KB Output is correct
5 Correct 404 ms 78568 KB Output is correct
6 Correct 405 ms 78564 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 421 ms 78572 KB Output is correct
2 Correct 412 ms 78656 KB Output is correct
3 Correct 461 ms 78568 KB Output is correct
4 Correct 456 ms 78476 KB Output is correct
5 Correct 481 ms 78604 KB Output is correct
6 Correct 386 ms 78532 KB Output is correct
7 Correct 459 ms 78652 KB Output is correct