oj.uz

Submission #401626

# Submission time Handle Problem Language Result Execution time Memory
401626 2021-05-10T15:05:53 Z jenkinsser Vepar (COCI21_vepar) C++17
70 / 70
 459 ms 86976 KB 
#include <bits/stdc++.h>
#define FOR(ii,aa,bb) for(int ii=aa;ii<bb;ii++)
#define for0(ii,bb) FOR(ii,0,bb)
#define for1(ii,bb) FOR(ii,1,bb+1)
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define st first
#define nd second
#define pii pair<int,int>
#define piii pair<int,pii>
#define piiii pair<pii,pii>
#define pdi pair<double,int>
#define vi vector<int>
#define sp " "
#define nl "\n"
#define all(x) x.begin(),x.end()
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);
#define ll long long
#define int ll

using namespace std;

const int N = 1e7+5;
const int INF = 1e9+5;
const int mod = 1e9+7;

int a,b,c,d;
vi prime(N,1);
vi primes;

int calc(int x,int y){
    if(x==0)
        return 0;
    return x/y+calc(x/y,y);
}

void solve(){
    cin >> a >> b >> c >> d;
    a--,c--;
    for(int i:primes){
        if(calc(b,i)-calc(a,i)>calc(d,i)-calc(c,i)){
            cout << "NE\n";
            return;
        }
    }
    cout << "DA\n";
}

signed main(){
    fastio()  
    for(int i=2;i<N;i++){
        if(prime[i]){
            primes.pb(i);
            for(int j=i*i;j<N;j+=i)
                prime[j]=0;
        }
    }
    int tt=1;
    cin >> tt;
    while(tt--)
        solve();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 328 ms 86840 KB Output is correct
2 Correct 363 ms 86900 KB Output is correct
3 Correct 277 ms 86896 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 340 ms 86916 KB Output is correct
2 Correct 330 ms 86828 KB Output is correct
3 Correct 324 ms 86908 KB Output is correct
4 Correct 358 ms 86896 KB Output is correct
5 Correct 310 ms 86904 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 385 ms 86900 KB Output is correct
2 Correct 318 ms 86884 KB Output is correct
3 Correct 342 ms 86880 KB Output is correct
4 Correct 325 ms 86884 KB Output is correct
5 Correct 336 ms 86876 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 404 ms 86852 KB Output is correct
2 Correct 328 ms 86884 KB Output is correct
3 Correct 293 ms 86956 KB Output is correct
4 Correct 351 ms 86856 KB Output is correct
5 Correct 322 ms 86912 KB Output is correct
6 Correct 325 ms 86900 KB Output is correct
7 Correct 459 ms 86916 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 395 ms 86884 KB Output is correct
2 Correct 299 ms 86880 KB Output is correct
3 Correct 381 ms 86884 KB Output is correct
4 Correct 338 ms 86840 KB Output is correct
5 Correct 340 ms 86888 KB Output is correct
6 Correct 382 ms 86928 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 386 ms 86840 KB Output is correct
2 Correct 272 ms 86896 KB Output is correct
3 Correct 355 ms 86892 KB Output is correct
4 Correct 311 ms 86924 KB Output is correct
5 Correct 336 ms 86868 KB Output is correct
6 Correct 391 ms 86892 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 379 ms 86920 KB Output is correct
2 Correct 315 ms 86892 KB Output is correct
3 Correct 313 ms 86904 KB Output is correct
4 Correct 330 ms 86892 KB Output is correct
5 Correct 320 ms 86892 KB Output is correct
6 Correct 368 ms 86976 KB Output is correct
7 Correct 430 ms 86840 KB Output is correct