oj.uz

Submission #212739

# Submission time Handle Problem Language Result Execution time Memory
212739 2020-03-24T08:32:57 Z urd05 Sushi (JOI16_sushi) C++14
20 / 100
 123 ms 11488 KB 
#include <bits/stdc++.h>
using namespace std;
 
long long arr[400000];
 
int main(void) {
	int n,q;
	scanf("%d %d\n",&n,&q);
	if (n<=2000&&q<=2000) {
		for(int i=0;i<n;i++) {
			scanf("%lld\n",&arr[i]);
		}
		for(int i=0;i<q;i++) {
			int s,t,p;
			scanf("%d %d %d\n",&s,&t,&p);
			s--;
			t--;
			long long big=p;
			int cnt=0;
			for(int i=s;cnt==0||i!=(t+1)%n;i=(i+1)%n) {
				if (arr[i]>big) {
					swap(arr[i],big);
				}
				cnt++;
			}
			printf("%lld\n",big);
		}
	}
	else {
		priority_queue<long long> pq;
		for(int i=0;i<n;i++) {
			scanf("%lld\n",&arr[i]);
			pq.push(arr[i]);
		}
		for(int i=0;i<q;i++) {
			int s,t,p;
			scanf("%d %d %d\n",&s,&t,&p);
			pq.push(p);
			printf("%lld\n",pq.top());
			pq.pop();
		}
	}
}

Compilation message

sushi.cpp: In function 'int main()':
sushi.cpp:8:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d\n",&n,&q);
  ~~~~~^~~~~~~~~~~~~~~~~
sushi.cpp:11:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld\n",&arr[i]);
    ~~~~~^~~~~~~~~~~~~~~~~~
sushi.cpp:15:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d %d %d\n",&s,&t,&p);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
sushi.cpp:32:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld\n",&arr[i]);
    ~~~~~^~~~~~~~~~~~~~~~~~
sushi.cpp:37:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d %d %d\n",&s,&t,&p);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 384 KB Output is correct
2 Correct 17 ms 384 KB Output is correct
3 Correct 17 ms 384 KB Output is correct
4 Correct 17 ms 384 KB Output is correct
5 Correct 17 ms 384 KB Output is correct
6 Correct 17 ms 384 KB Output is correct
7 Correct 16 ms 384 KB Output is correct
8 Correct 17 ms 384 KB Output is correct
9 Correct 17 ms 512 KB Output is correct
10 Correct 17 ms 384 KB Output is correct
11 Correct 20 ms 384 KB Output is correct
12 Correct 19 ms 384 KB Output is correct
13 Correct 21 ms 504 KB Output is correct
14 Correct 27 ms 384 KB Output is correct
15 Correct 28 ms 504 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 4 ms 256 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 5 ms 304 KB Output is correct
21 Correct 4 ms 256 KB Output is correct
22 Correct 5 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 11244 KB Output is correct
2 Correct 107 ms 9948 KB Output is correct
3 Correct 68 ms 7900 KB Output is correct
4 Correct 114 ms 11284 KB Output is correct
5 Correct 104 ms 11356 KB Output is correct
6 Correct 115 ms 11488 KB Output is correct
7 Correct 104 ms 11356 KB Output is correct
8 Correct 107 ms 11356 KB Output is correct
9 Correct 65 ms 7776 KB Output is correct
10 Correct 97 ms 9820 KB Output is correct
11 Correct 64 ms 7904 KB Output is correct
12 Correct 97 ms 9948 KB Output is correct
13 Correct 117 ms 11228 KB Output is correct
14 Correct 102 ms 9948 KB Output is correct
15 Correct 69 ms 7776 KB Output is correct
16 Correct 116 ms 11356 KB Output is correct
17 Correct 103 ms 11360 KB Output is correct
18 Correct 105 ms 11356 KB Output is correct
19 Correct 111 ms 11340 KB Output is correct
20 Correct 104 ms 11356 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 384 KB Output is correct
2 Correct 17 ms 384 KB Output is correct
3 Correct 17 ms 384 KB Output is correct
4 Correct 17 ms 384 KB Output is correct
5 Correct 17 ms 384 KB Output is correct
6 Correct 17 ms 384 KB Output is correct
7 Correct 16 ms 384 KB Output is correct
8 Correct 17 ms 384 KB Output is correct
9 Correct 17 ms 512 KB Output is correct
10 Correct 17 ms 384 KB Output is correct
11 Correct 20 ms 384 KB Output is correct
12 Correct 19 ms 384 KB Output is correct
13 Correct 21 ms 504 KB Output is correct
14 Correct 27 ms 384 KB Output is correct
15 Correct 28 ms 504 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 4 ms 256 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 5 ms 304 KB Output is correct
21 Correct 4 ms 256 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 123 ms 11244 KB Output is correct
24 Correct 107 ms 9948 KB Output is correct
25 Correct 68 ms 7900 KB Output is correct
26 Correct 114 ms 11284 KB Output is correct
27 Correct 104 ms 11356 KB Output is correct
28 Correct 115 ms 11488 KB Output is correct
29 Correct 104 ms 11356 KB Output is correct
30 Correct 107 ms 11356 KB Output is correct
31 Correct 65 ms 7776 KB Output is correct
32 Correct 97 ms 9820 KB Output is correct
33 Correct 64 ms 7904 KB Output is correct
34 Correct 97 ms 9948 KB Output is correct
35 Correct 117 ms 11228 KB Output is correct
36 Correct 102 ms 9948 KB Output is correct
37 Correct 69 ms 7776 KB Output is correct
38 Correct 116 ms 11356 KB Output is correct
39 Correct 103 ms 11360 KB Output is correct
40 Correct 105 ms 11356 KB Output is correct
41 Correct 111 ms 11340 KB Output is correct
42 Correct 104 ms 11356 KB Output is correct
43 Incorrect 121 ms 11360 KB Output isn't correct
44 Halted 0 ms 0 KB -