oj.uz

Submission #768743

# Submission time Handle Problem Language Result Execution time Memory
768743 2023-06-28T14:19:48 Z 1075508020060209tc Vepar (COCI21_vepar) C++14
70 / 70
 1451 ms 43924 KB 
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define X first
#define Y second
int ttt;
vector<int>prm;
int prmtbl[10000007];
 int ans[11];
int A[11];int B[11];int C[11];int D[11];
int ac[11];int bc[11];
void solve(){
for(int pid=0;pid<prm.size();pid++){
    for(int t=1;t<=ttt;t++){
        ac[t]=0;bc[t]=0;
    }
    int p=prm[pid];
    for(int i=p;i<=10000000;i+=p){
        int v=i;
        int vc=0;
        while(v%p==0){
            vc++;
            v/=p;
        }
        for(int t=1;t<=ttt;t++){
            if(i>=A[t]&&i<=B[t]){
                ac[t]+=vc;
            }
            if(i>=C[t]&&i<=D[t]){
                bc[t]+=vc;
            }
        }
    }
    for(int t=1;t<=ttt;t++){
        if(ac[t]>bc[t]){
            ans[t]=0;
        }
    }

}



}


signed main(){

for(int i=2;i<=10000000;i++){
    if(prmtbl[i]==0){
        prm.push_back(i);
    }
    for(int j=i+i;j<=10000000;j+=i){
        prmtbl[j]=1;
    }
}
cin>>ttt;

for(int i=1;i<=ttt;i++){
    ans[i]=1;
    cin>>A[i]>>B[i]>>C[i]>>D[i];
}
solve();
for(int i=1;i<=ttt;i++){
    if(ans[i]==1){
        cout<<"DA\n";
    }else{
        cout<<"NE\n";
    }
}



}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:13:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 | for(int pid=0;pid<prm.size();pid++){
      |               ~~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1368 ms 43620 KB Output is correct
2 Correct 1387 ms 43676 KB Output is correct
3 Correct 1373 ms 43580 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1403 ms 43612 KB Output is correct
2 Correct 1371 ms 43588 KB Output is correct
3 Correct 1402 ms 43620 KB Output is correct
4 Correct 1393 ms 43924 KB Output is correct
5 Correct 1416 ms 43616 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1378 ms 43628 KB Output is correct
2 Correct 1388 ms 43616 KB Output is correct
3 Correct 1398 ms 43616 KB Output is correct
4 Correct 1372 ms 43572 KB Output is correct
5 Correct 1385 ms 43664 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1396 ms 43752 KB Output is correct
2 Correct 1406 ms 43732 KB Output is correct
3 Correct 1416 ms 43616 KB Output is correct
4 Correct 1384 ms 43708 KB Output is correct
5 Correct 1397 ms 43612 KB Output is correct
6 Correct 1363 ms 43740 KB Output is correct
7 Correct 1368 ms 43624 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1431 ms 43620 KB Output is correct
2 Correct 1390 ms 43628 KB Output is correct
3 Correct 1403 ms 43636 KB Output is correct
4 Correct 1399 ms 43544 KB Output is correct
5 Correct 1399 ms 43576 KB Output is correct
6 Correct 1451 ms 43644 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1446 ms 43624 KB Output is correct
2 Correct 1404 ms 43600 KB Output is correct
3 Correct 1413 ms 43648 KB Output is correct
4 Correct 1408 ms 43596 KB Output is correct
5 Correct 1415 ms 43608 KB Output is correct
6 Correct 1426 ms 43624 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1431 ms 43624 KB Output is correct
2 Correct 1411 ms 43632 KB Output is correct
3 Correct 1379 ms 43804 KB Output is correct
4 Correct 1441 ms 43620 KB Output is correct
5 Correct 1418 ms 43620 KB Output is correct
6 Correct 1409 ms 43620 KB Output is correct
7 Correct 1375 ms 43576 KB Output is correct