oj.uz

Submission #489681

# Submission time Handle Problem Language Result Execution time Memory
489681 2021-11-23T18:35:33 Z inksamurai Vepar (COCI21_vepar) C++17
70 / 70
 790 ms 169400 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;
ll 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)->ll{
		if(prm>n) return 0;
		ll x=prm;
		vi rbts;
		while(x<=n){
			rbts.pb(x);
			x*=prm;
		}
		ll now=0;
		for(auto x : rbts){
			now+=(ll)(n/x);
		}
		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;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 481 ms 169264 KB Output is correct
2 Correct 484 ms 169292 KB Output is correct
3 Correct 479 ms 169304 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 459 ms 169320 KB Output is correct
2 Correct 496 ms 169292 KB Output is correct
3 Correct 492 ms 169316 KB Output is correct
4 Correct 488 ms 169264 KB Output is correct
5 Correct 479 ms 169320 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 492 ms 169364 KB Output is correct
2 Correct 482 ms 169264 KB Output is correct
3 Correct 546 ms 169304 KB Output is correct
4 Correct 505 ms 169292 KB Output is correct
5 Correct 480 ms 169276 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 570 ms 169288 KB Output is correct
2 Correct 575 ms 169300 KB Output is correct
3 Correct 679 ms 169264 KB Output is correct
4 Correct 640 ms 169288 KB Output is correct
5 Correct 625 ms 169396 KB Output is correct
6 Correct 436 ms 169324 KB Output is correct
7 Correct 724 ms 169312 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 731 ms 169300 KB Output is correct
2 Correct 536 ms 169280 KB Output is correct
3 Correct 511 ms 169268 KB Output is correct
4 Correct 538 ms 169264 KB Output is correct
5 Correct 645 ms 169284 KB Output is correct
6 Correct 728 ms 169296 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 734 ms 169312 KB Output is correct
2 Correct 513 ms 169300 KB Output is correct
3 Correct 560 ms 169304 KB Output is correct
4 Correct 550 ms 169276 KB Output is correct
5 Correct 566 ms 169348 KB Output is correct
6 Correct 779 ms 169276 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 702 ms 169304 KB Output is correct
2 Correct 515 ms 169368 KB Output is correct
3 Correct 490 ms 169292 KB Output is correct
4 Correct 564 ms 169400 KB Output is correct
5 Correct 560 ms 169292 KB Output is correct
6 Correct 790 ms 169288 KB Output is correct
7 Correct 770 ms 169352 KB Output is correct