oj.uz

Submission #595730

# Submission time Handle Problem Language Result Execution time Memory
595730 2022-07-14T04:43:39 Z 반딧불(#8442) Sushi (JOI16_sushi) C++17
5 / 100
 12000 ms 6840 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int n, q;
int arr[400002];
int s[25002], t[25002], p[25002];

int main(){
    scanf("%d %d", &n, &q);
    for(int i=1; i<=n; i++) scanf("%d", &arr[i]);
    for(int i=1; i<=q; i++) scanf("%d %d %d", &s[i], &t[i], &p[i]);
    for(int i=1; i<=q; i++){
        int x = p[i];
        if(s[i] <= t[i]){
            for(int j=s[i]; j<=t[i]; j++){
                if(x < arr[j]) swap(x, arr[j]);
            }
        }
        else{
            for(int j=s[i]; j<=n; j++) if(x<arr[j]) swap(x, arr[j]);
            for(int j=1; j<=t[i]; j++) if(x<arr[j]) swap(x, arr[j]);
        }
        printf("%d\n", x);
//        for(int i=1; i<=n; i++) printf("%d ", arr[i]);
//        puts("");
    }
}

Compilation message

sushi.cpp: In function 'int main()':
sushi.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     scanf("%d %d", &n, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~
sushi.cpp:13:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     for(int i=1; i<=n; i++) scanf("%d", &arr[i]);
      |                             ~~~~~^~~~~~~~~~~~~~~
sushi.cpp:14:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     for(int i=1; i<=q; i++) scanf("%d %d %d", &s[i], &t[i], &p[i]);
      |                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 320 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 4 ms 324 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 7 ms 400 KB Output is correct
14 Correct 4 ms 340 KB Output is correct
15 Correct 5 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 320 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 4 ms 324 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 4 ms 340 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 7 ms 400 KB Output is correct
14 Correct 4 ms 340 KB Output is correct
15 Correct 5 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Execution timed out 12069 ms 6840 KB Time limit exceeded
24 Halted 0 ms 0 KB -