# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
489674 |
2021-11-23T18:20:10 Z |
inksamurai |
Vepar (COCI21_vepar) |
C++17 |
|
891 ms |
91160 KB |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _3oIUrY0 ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;
const int _n=1e7+20;
int a[_n+10],b[_n+10];
bool sv[_n+10];
int main(){
_3oIUrY0;
for(int i=2;i<=_n;i++){
if(sv[i]) continue;
for(int j=2*i;j<=_n;j+=i){
if(sv[j]==0) sv[j]=i;
}
}
vi prms;
for(int i=2;i<=_n;i++){
if(!sv[i]){
prms.pb(i);
}
}
auto f=[&](int prm,int n)->int{
if(prm>n) return 0;
int x=prm;
vi rbts;
while(x<=n){
rbts.pb(x);
x*=prm;
}
int _sum=0,now=0;
drep(i,sz(rbts)){
x=rbts[i];
now+=((n/x)-_sum)*(i+1);
_sum+=((n/x)-_sum);
}
return now;
};
int t;
cin>>t;
rep(cs,t){
int _a,_b,_c,_d;
cin>>_a>>_b>>_c>>_d;
for(auto prm : prms){
b[prm]+=f(prm,_b);
b[prm]-=f(prm,_a-1);
a[prm]+=f(prm,_d);
a[prm]-=f(prm,_c-1);
}
bool pok=1;
for(auto prm : prms){
if(b[prm]>a[prm]){
pok=0;
}
a[prm]=b[prm]=0;
}
cout<<(pok?"DA":"NE")<<"\n";
}
//
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
322 ms |
91056 KB |
Output is correct |
2 |
Correct |
332 ms |
91040 KB |
Output is correct |
3 |
Correct |
334 ms |
91080 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
331 ms |
91092 KB |
Output is correct |
2 |
Correct |
348 ms |
91160 KB |
Output is correct |
3 |
Correct |
344 ms |
91080 KB |
Output is correct |
4 |
Correct |
344 ms |
91080 KB |
Output is correct |
5 |
Correct |
334 ms |
91088 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
348 ms |
91100 KB |
Output is correct |
2 |
Correct |
322 ms |
91012 KB |
Output is correct |
3 |
Correct |
325 ms |
91084 KB |
Output is correct |
4 |
Correct |
332 ms |
91084 KB |
Output is correct |
5 |
Correct |
322 ms |
91080 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
544 ms |
91068 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
870 ms |
91088 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
880 ms |
91084 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
891 ms |
91092 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |