oj.uz

답안 #445569

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
445569 2021-07-18T17:20:18 Z hgmhc Sushi (JOI16_sushi) C++17
5 / 100
 12000 ms 6576 KB 
#include <bits/stdc++.h>
#define REP(i,a,b) for (auto i = (a); i <= (b); ++i)
#define PER(i,a,b) for (auto i = (b); i >= (a); --i)
#define log2(x) (31-__builtin_clz(x))
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) (int)(x).size()
#define mup(x,y) x = min(x,y)
#define Mup(x,y) x = max(x,y)
#define debug(x) cout << #x << " is " << x << el
#define el '\n'
using namespace std; using ll = long long; using ii = pair<int,int>; using iii = tuple<int,int,int>;
void solution(); int main() {ios::sync_with_stdio(0); cin.tie(0); solution();}
const int N = 400'003;
int n, q, plate[N];
 
void input() {
    cin >> n >> q;
    REP(i,1,n) cin >> plate[i];
}
void solution() {
    input();
    REP(i,1,q) {
        int s, t, p; cin >> s >> t >> p;
        if (s <= t) {
        REP(i,s,t) if (p < plate[i]) swap(p,plate[i]);
        } else {
        REP(i,s,n) if (p < plate[i]) swap(p,plate[i]);
        REP(i,1,t) if (p < plate[i]) swap(p,plate[i]);
        }
        cout << p << el;
    }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 332 KB Output is correct
2 Correct 5 ms 332 KB Output is correct
3 Correct 5 ms 332 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
6 Correct 4 ms 332 KB Output is correct
7 Correct 4 ms 332 KB Output is correct
8 Correct 4 ms 332 KB Output is correct
9 Correct 5 ms 332 KB Output is correct
10 Correct 4 ms 332 KB Output is correct
11 Correct 6 ms 332 KB Output is correct
12 Correct 6 ms 332 KB Output is correct
13 Correct 8 ms 332 KB Output is correct
14 Correct 7 ms 332 KB Output is correct
15 Correct 7 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 12028 ms 6576 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 332 KB Output is correct
2 Correct 5 ms 332 KB Output is correct
3 Correct 5 ms 332 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
6 Correct 4 ms 332 KB Output is correct
7 Correct 4 ms 332 KB Output is correct
8 Correct 4 ms 332 KB Output is correct
9 Correct 5 ms 332 KB Output is correct
10 Correct 4 ms 332 KB Output is correct
11 Correct 6 ms 332 KB Output is correct
12 Correct 6 ms 332 KB Output is correct
13 Correct 8 ms 332 KB Output is correct
14 Correct 7 ms 332 KB Output is correct
15 Correct 7 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Execution timed out 12028 ms 6576 KB Time limit exceeded
24 Halted 0 ms 0 KB -