oj.uz

Submission #929047

# Submission time Handle Problem Language Result Execution time Memory
929047 2024-02-17T14:42:34 Z a_l_i_r_e_z_a Vepar (COCI21_vepar) C++17
70 / 70
 198 ms 20424 KB 
// In the name of God
// Hope is last to die

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

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define int long long    
#define S second
#define F first
#define mp make_pair
#define smax(x, y) (x) = max((x), (y))
#define smin(x, y) (x) = min((x), (y))
#define all(x) (x).begin(), (x).end()
#define len(x) ((int)(x).size())

const int maxn = 1e7 + 5;
const int inf = 1e9 + 7;
bool mark[maxn];

int get(int a, int b, int p){
    int res = 0;
    int m = p;
    while(m <= b){
        res += b / m - ((a - 1) / m);
        m *= p;
    }
    return res;
}

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

    vector<int> prime;
    for(int i = 2; i < maxn; i++){
        if(!mark[i]) prime.pb(i);
        for(auto u: prime){
            if(1ll * u * i > maxn) break;
            mark[u * i] = 1;
            if(i % u == 0) break;
        }
    }
    int t; cin >> t;
    while(t--){
        int a, b, c, d; cin >> a >> b >> c >> d;
        bool flag = 1;
        for(auto p: prime){
            int x = get(a, b, p), y = get(c, d, p);
            if(x > y) flag = 0;
        }
        if(flag) cout << "DA\n";
        else cout << "NE\n";
    }

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 19280 KB Output is correct
2 Correct 88 ms 19652 KB Output is correct
3 Correct 90 ms 20424 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 18880 KB Output is correct
2 Correct 90 ms 20344 KB Output is correct
3 Correct 88 ms 19652 KB Output is correct
4 Correct 90 ms 20164 KB Output is correct
5 Correct 88 ms 18712 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 19328 KB Output is correct
2 Correct 88 ms 20260 KB Output is correct
3 Correct 88 ms 19392 KB Output is correct
4 Correct 95 ms 19904 KB Output is correct
5 Correct 89 ms 20160 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 20164 KB Output is correct
2 Correct 113 ms 19540 KB Output is correct
3 Correct 158 ms 20260 KB Output is correct
4 Correct 132 ms 19544 KB Output is correct
5 Correct 132 ms 19592 KB Output is correct
6 Correct 120 ms 20160 KB Output is correct
7 Correct 198 ms 20160 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 18492 KB Output is correct
2 Correct 99 ms 19796 KB Output is correct
3 Correct 100 ms 19364 KB Output is correct
4 Correct 110 ms 19908 KB Output is correct
5 Correct 116 ms 18880 KB Output is correct
6 Correct 165 ms 20096 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 19148 KB Output is correct
2 Correct 97 ms 20340 KB Output is correct
3 Correct 100 ms 19528 KB Output is correct
4 Correct 112 ms 20416 KB Output is correct
5 Correct 118 ms 19340 KB Output is correct
6 Correct 165 ms 19396 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 18628 KB Output is correct
2 Correct 98 ms 19396 KB Output is correct
3 Correct 98 ms 19720 KB Output is correct
4 Correct 111 ms 19652 KB Output is correct
5 Correct 110 ms 18876 KB Output is correct
6 Correct 169 ms 19260 KB Output is correct
7 Correct 196 ms 18876 KB Output is correct