oj.uz

Submission #490683

# Submission time Handle Problem Language Result Execution time Memory
490683 2021-11-28T16:37:08 Z irmuun Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
8 / 100
 3000 ms 6608 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
	ll n,m,w[200001],h[200001],l,r,k,ans,i,j,b,c;
	cin>>n>>m;
	for(i=1;i<=n;i++){
		cin>>w[i];
		h[i]=w[i];
	}
	for(i=1;i<=m;i++){
		cin>>l>>r>>k;
		c=0;
		while(c==0){
			c=1;
			for(j=l;j<r;j++){
				if(w[j]+w[j+1]<=k&&w[j]>w[j+1]){
					c=0;
					swap(w[j],w[j+1]);
				}
			}
		}
		c=1;
		for(j=l;j<r;j++){
			if(w[j]>w[j+1]){
				c=0;
				break;
			}
		}
		cout<<c<<endl;
		for(j=l;j<=r;j++){
			w[j]=h[j];
		}
	}
}

Compilation message

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:5:35: warning: unused variable 'ans' [-Wunused-variable]
    5 |  ll n,m,w[200001],h[200001],l,r,k,ans,i,j,b,c;
      |                                   ^~~
sortbooks.cpp:5:43: warning: unused variable 'b' [-Wunused-variable]
    5 |  ll n,m,w[200001],h[200001],l,r,k,ans,i,j,b,c;
      |                                           ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3404 KB Output is correct
2 Correct 2 ms 3404 KB Output is correct
3 Correct 4 ms 3404 KB Output is correct
4 Correct 3 ms 3404 KB Output is correct
5 Correct 3 ms 3404 KB Output is correct
6 Correct 32 ms 3404 KB Output is correct
7 Correct 31 ms 3404 KB Output is correct
8 Correct 18 ms 3404 KB Output is correct
9 Correct 16 ms 3404 KB Output is correct
10 Correct 17 ms 3404 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3404 KB Output is correct
2 Correct 2 ms 3404 KB Output is correct
3 Correct 4 ms 3404 KB Output is correct
4 Correct 3 ms 3404 KB Output is correct
5 Correct 3 ms 3404 KB Output is correct
6 Correct 32 ms 3404 KB Output is correct
7 Correct 31 ms 3404 KB Output is correct
8 Correct 18 ms 3404 KB Output is correct
9 Correct 16 ms 3404 KB Output is correct
10 Correct 17 ms 3404 KB Output is correct
11 Correct 1501 ms 3468 KB Output is correct
12 Execution timed out 3094 ms 3404 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 74 ms 6608 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3060 ms 3412 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3404 KB Output is correct
2 Correct 2 ms 3404 KB Output is correct
3 Correct 4 ms 3404 KB Output is correct
4 Correct 3 ms 3404 KB Output is correct
5 Correct 3 ms 3404 KB Output is correct
6 Correct 32 ms 3404 KB Output is correct
7 Correct 31 ms 3404 KB Output is correct
8 Correct 18 ms 3404 KB Output is correct
9 Correct 16 ms 3404 KB Output is correct
10 Correct 17 ms 3404 KB Output is correct
11 Correct 1501 ms 3468 KB Output is correct
12 Execution timed out 3094 ms 3404 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3404 KB Output is correct
2 Correct 2 ms 3404 KB Output is correct
3 Correct 4 ms 3404 KB Output is correct
4 Correct 3 ms 3404 KB Output is correct
5 Correct 3 ms 3404 KB Output is correct
6 Correct 32 ms 3404 KB Output is correct
7 Correct 31 ms 3404 KB Output is correct
8 Correct 18 ms 3404 KB Output is correct
9 Correct 16 ms 3404 KB Output is correct
10 Correct 17 ms 3404 KB Output is correct
11 Correct 1501 ms 3468 KB Output is correct
12 Execution timed out 3094 ms 3404 KB Time limit exceeded
13 Halted 0 ms 0 KB -