oj.uz

답안 #595732

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
595732 2022-07-14T04:52:36 Z 조영욱(#8444) Sushi (JOI16_sushi) C++17
20 / 100
 75 ms 8188 KB 
#include <bits/stdc++.h>
using namespace std;

int n,q;
int arr[1000000];

int main() {
    scanf("%d %d",&n,&q);
    for(int i=0;i<n;i++) {
        scanf("%d",&arr[i]);
    }
    if (n<=2000&&q<=2000) {
        for(int i=0;i<q;i++) {
            int s,t,p;
            scanf("%d %d %d",&s,&t,&p);
            s--;
            t--;
            while (1) {
                if (arr[s]>p) {
                    swap(arr[s],p);
                }
                if (s==t) {
                    break;
                }
                s=(s+1)%n;
            }
            printf("%d\n",p);
        }
        return 0;
    }
    priority_queue<int> pq;
    for(int i=0;i<n;i++) {
        pq.push(arr[i]);
    }
    for(int i=0;i<q;i++) {
        int s,t,p;
        scanf("%d %d %d",&s,&t,&p);
        pq.push(p);
        printf("%d\n",pq.top());
        pq.pop();
    }
    return 0;
}

Compilation message

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 212 KB Output is correct
2 Correct 12 ms 336 KB Output is correct
3 Correct 11 ms 212 KB Output is correct
4 Correct 11 ms 212 KB Output is correct
5 Correct 12 ms 324 KB Output is correct
6 Correct 12 ms 340 KB Output is correct
7 Correct 11 ms 316 KB Output is correct
8 Correct 11 ms 320 KB Output is correct
9 Correct 11 ms 328 KB Output is correct
10 Correct 11 ms 212 KB Output is correct
11 Correct 12 ms 328 KB Output is correct
12 Correct 14 ms 212 KB Output is correct
13 Correct 14 ms 328 KB Output is correct
14 Correct 20 ms 212 KB Output is correct
15 Correct 20 ms 332 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 1 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
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 3952 KB Output is correct
2 Correct 60 ms 6836 KB Output is correct
3 Correct 42 ms 4956 KB Output is correct
4 Correct 64 ms 8100 KB Output is correct
5 Correct 69 ms 8088 KB Output is correct
6 Correct 70 ms 8172 KB Output is correct
7 Correct 67 ms 8084 KB Output is correct
8 Correct 73 ms 8100 KB Output is correct
9 Correct 38 ms 5028 KB Output is correct
10 Correct 63 ms 6776 KB Output is correct
11 Correct 54 ms 5056 KB Output is correct
12 Correct 61 ms 6976 KB Output is correct
13 Correct 64 ms 8096 KB Output is correct
14 Correct 53 ms 6812 KB Output is correct
15 Correct 43 ms 5036 KB Output is correct
16 Correct 63 ms 8168 KB Output is correct
17 Correct 70 ms 8076 KB Output is correct
18 Correct 66 ms 8104 KB Output is correct
19 Correct 75 ms 8188 KB Output is correct
20 Correct 64 ms 8148 KB Output is correct

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 212 KB Output is correct
2 Correct 12 ms 336 KB Output is correct
3 Correct 11 ms 212 KB Output is correct
4 Correct 11 ms 212 KB Output is correct
5 Correct 12 ms 324 KB Output is correct
6 Correct 12 ms 340 KB Output is correct
7 Correct 11 ms 316 KB Output is correct
8 Correct 11 ms 320 KB Output is correct
9 Correct 11 ms 328 KB Output is correct
10 Correct 11 ms 212 KB Output is correct
11 Correct 12 ms 328 KB Output is correct
12 Correct 14 ms 212 KB Output is correct
13 Correct 14 ms 328 KB Output is correct
14 Correct 20 ms 212 KB Output is correct
15 Correct 20 ms 332 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 1 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 Correct 65 ms 3952 KB Output is correct
24 Correct 60 ms 6836 KB Output is correct
25 Correct 42 ms 4956 KB Output is correct
26 Correct 64 ms 8100 KB Output is correct
27 Correct 69 ms 8088 KB Output is correct
28 Correct 70 ms 8172 KB Output is correct
29 Correct 67 ms 8084 KB Output is correct
30 Correct 73 ms 8100 KB Output is correct
31 Correct 38 ms 5028 KB Output is correct
32 Correct 63 ms 6776 KB Output is correct
33 Correct 54 ms 5056 KB Output is correct
34 Correct 61 ms 6976 KB Output is correct
35 Correct 64 ms 8096 KB Output is correct
36 Correct 53 ms 6812 KB Output is correct
37 Correct 43 ms 5036 KB Output is correct
38 Correct 63 ms 8168 KB Output is correct
39 Correct 70 ms 8076 KB Output is correct
40 Correct 66 ms 8104 KB Output is correct
41 Correct 75 ms 8188 KB Output is correct
42 Correct 64 ms 8148 KB Output is correct
43 Incorrect 74 ms 8124 KB Output isn't correct
44 Halted 0 ms 0 KB -