oj.uz

Submission #134557

# Submission time Handle Problem Language Result Execution time Memory
134557 2019-07-23T03:49:18 Z 이온조(#3239) Sushi (JOI16_sushi) C++14
5 / 100
 12000 ms 6656 KB 
#include <bits/stdc++.h>
using namespace std;

int X[400009];

int main() {
	int N, Q; scanf("%d%d",&N,&Q);
	for(int i=1; i<=N; i++) scanf("%d",&X[i]);
	while(Q--) {
		int S, T, P; scanf("%d%d%d",&S,&T,&P);
		int x = P;
		if(S <= T) {
			for(int i=S; i<=T; i++) if(X[i] > x) swap(X[i], x);
		}
		else {
			for(int i=S; i<=N; i++) if(X[i] > x) swap(X[i], x);
			for(int i=1; i<=T; i++) if(X[i] > x) swap(X[i], x);
		}
		printf("%d\n", x);
	}
	return 0;
}

Compilation message

sushi.cpp: In function 'int main()':
sushi.cpp:7:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int N, Q; scanf("%d%d",&N,&Q);
            ~~~~~^~~~~~~~~~~~~~
sushi.cpp:8:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1; i<=N; i++) scanf("%d",&X[i]);
                          ~~~~~^~~~~~~~~~~~
sushi.cpp:10:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int S, T, P; scanf("%d%d%d",&S,&T,&P);
                ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 15.0

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

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 504 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 6 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 7 ms 408 KB Output is correct
13 Correct 10 ms 376 KB Output is correct
14 Correct 8 ms 376 KB Output is correct
15 Correct 8 ms 376 KB Output is correct
16 Correct 4 ms 376 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 252 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Execution timed out 12007 ms 6656 KB Time limit exceeded
24 Halted 0 ms 0 KB -