oj.uz

Submission #524347

# Submission time Handle Problem Language Result Execution time Memory
524347 2022-02-09T05:14:31 Z veos Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++11
8 / 100
 3000 ms 6220 KB 
#include <stdio.h>
using namespace std;
int main(){
	int m,n;
	scanf("%d %d", &n, &m);
	int b[n+1];
	b[0]=0;  
	for(int i=1;i<=n;i++){
		scanf("%d",&b[i]);
	}
	for(int y=0;y<m;y++){
		bool w=true;
		int l,r,k;
		scanf("%d %d %d",&l,&r,&k);
		for(int i=l;w&&i<r;i++){
			for(int j=i+1;w&&j<=r;j++){
				if(b[i]>b[j]&&k<b[i]+b[j]){
					w=false;
				}
			}    
		}
		printf("%d\n", w);
	}
}

Compilation message

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:5:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 |  scanf("%d %d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~~
sortbooks.cpp:9:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |   scanf("%d",&b[i]);
      |   ~~~~~^~~~~~~~~~~~
sortbooks.cpp:14:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |   scanf("%d %d %d",&l,&r,&k);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 19 ms 272 KB Output is correct
9 Correct 7 ms 204 KB Output is correct
10 Correct 6 ms 276 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 19 ms 272 KB Output is correct
9 Correct 7 ms 204 KB Output is correct
10 Correct 6 ms 276 KB Output is correct
11 Correct 22 ms 204 KB Output is correct
12 Correct 149 ms 276 KB Output is correct
13 Correct 103 ms 204 KB Output is correct
14 Correct 237 ms 416 KB Output is correct
15 Correct 139 ms 280 KB Output is correct
16 Execution timed out 3084 ms 204 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 601 ms 6212 KB Output is correct
2 Correct 551 ms 6220 KB Output is correct
3 Correct 543 ms 6088 KB Output is correct
4 Correct 558 ms 6080 KB Output is correct
5 Execution timed out 3057 ms 4300 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 19 ms 272 KB Output is correct
9 Correct 7 ms 204 KB Output is correct
10 Correct 6 ms 276 KB Output is correct
11 Correct 22 ms 204 KB Output is correct
12 Correct 149 ms 276 KB Output is correct
13 Correct 103 ms 204 KB Output is correct
14 Correct 237 ms 416 KB Output is correct
15 Correct 139 ms 280 KB Output is correct
16 Execution timed out 3084 ms 204 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 19 ms 272 KB Output is correct
9 Correct 7 ms 204 KB Output is correct
10 Correct 6 ms 276 KB Output is correct
11 Correct 22 ms 204 KB Output is correct
12 Correct 149 ms 276 KB Output is correct
13 Correct 103 ms 204 KB Output is correct
14 Correct 237 ms 416 KB Output is correct
15 Correct 139 ms 280 KB Output is correct
16 Execution timed out 3084 ms 204 KB Time limit exceeded
17 Halted 0 ms 0 KB -