oj.uz

답안 #493155

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
493155 2021-12-10T07:32:59 Z Khizri Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
30 / 100
 2348 ms 17920 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define int long long
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=1e6+5;
int t=1,n,q,arr[mxn],l,r,k,color[mxn];
int res(){
	multiset<int>st;
	for(int i=l;i<=r;i++){
		st.insert(arr[i]);
	}
	for(int i=l;i<=r;i++){
		st.erase(st.find(arr[i]));
		auto it=st.lower_bound(arr[i]);
		if(it!=st.begin()){
			it--;
			int x=*it;
			if(x+arr[i]>k){
				return 0;
			}
		}
	}
	return 1;
}
void solve2(){
	while(q--){
		scanf("%lld %lld %lld",&l,&r,&k);
		printf("%lld\n",res());
	}
}
void solve(){
	scanf("%lld %lld",&n,&q);
	for(int i=1;i<=n;i++){
		scanf("%lld",&arr[i]);
	}
	if(n<=5000){
		solve2();
		return;
	}
	int x=0;
	for(int i=1;i<=n;i++){
		if(arr[i-1]>arr[i]){
			color[i]=++x;
		}
		else{
			color[i]=x;
		}
	}
	while(q--){
		scanf("%lld %lld %lld",&l,&r,&k);
		if(color[l]==color[r]){
			printf("1\n");
		}
		else{
			printf("0\n");
		}
	}
}
signed main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Compilation message

sortbooks.cpp: In function 'void solve2()':
sortbooks.cpp:65:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |   scanf("%lld %lld %lld",&l,&r,&k);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp: In function 'void solve()':
sortbooks.cpp:70:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |  scanf("%lld %lld",&n,&q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~
sortbooks.cpp:72:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |   scanf("%lld",&arr[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~
sortbooks.cpp:88:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |   scanf("%lld %lld %lld",&l,&r,&k);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 7 ms 332 KB Output is correct
7 Correct 7 ms 332 KB Output is correct
8 Correct 17 ms 364 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 13 ms 360 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 7 ms 332 KB Output is correct
7 Correct 7 ms 332 KB Output is correct
8 Correct 17 ms 364 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 13 ms 360 KB Output is correct
11 Correct 121 ms 444 KB Output is correct
12 Correct 412 ms 668 KB Output is correct
13 Correct 475 ms 588 KB Output is correct
14 Correct 838 ms 840 KB Output is correct
15 Correct 832 ms 736 KB Output is correct
16 Correct 2348 ms 820 KB Output is correct
17 Correct 1609 ms 764 KB Output is correct
18 Correct 1660 ms 668 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 519 ms 17880 KB Output is correct
2 Correct 566 ms 17884 KB Output is correct
3 Correct 524 ms 17900 KB Output is correct
4 Correct 519 ms 17920 KB Output is correct
5 Correct 548 ms 17848 KB Output is correct

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 43 ms 1972 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 7 ms 332 KB Output is correct
7 Correct 7 ms 332 KB Output is correct
8 Correct 17 ms 364 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 13 ms 360 KB Output is correct
11 Correct 121 ms 444 KB Output is correct
12 Correct 412 ms 668 KB Output is correct
13 Correct 475 ms 588 KB Output is correct
14 Correct 838 ms 840 KB Output is correct
15 Correct 832 ms 736 KB Output is correct
16 Correct 2348 ms 820 KB Output is correct
17 Correct 1609 ms 764 KB Output is correct
18 Correct 1660 ms 668 KB Output is correct
19 Incorrect 105 ms 10392 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 7 ms 332 KB Output is correct
7 Correct 7 ms 332 KB Output is correct
8 Correct 17 ms 364 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 13 ms 360 KB Output is correct
11 Correct 121 ms 444 KB Output is correct
12 Correct 412 ms 668 KB Output is correct
13 Correct 475 ms 588 KB Output is correct
14 Correct 838 ms 840 KB Output is correct
15 Correct 832 ms 736 KB Output is correct
16 Correct 2348 ms 820 KB Output is correct
17 Correct 1609 ms 764 KB Output is correct
18 Correct 1660 ms 668 KB Output is correct
19 Correct 519 ms 17880 KB Output is correct
20 Correct 566 ms 17884 KB Output is correct
21 Correct 524 ms 17900 KB Output is correct
22 Correct 519 ms 17920 KB Output is correct
23 Correct 548 ms 17848 KB Output is correct
24 Incorrect 43 ms 1972 KB Output isn't correct
25 Halted 0 ms 0 KB -