# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
496061 | 2021-12-20T13:50:28 Z | 600Mihnea | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 9000 ms | 2744 KB |
#include "bubblesort2.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; vector<int> innterCountScans(vector<ll> a, vector<int> pos, vector<ll> value) { int n = (int) a.size(); int q = (int) pos.size(); for (int i = 0; i < n; i++) { a[i] = a[i] * (ll) (n + 1) + i; } assert(q == (int) value.size()); for (int it = 0; it < q; it++) { value[it] = value[it] * (ll) (n + 1) + pos[it]; } vector<int> sol; for (int it = 0; it < q; it++) { a[pos[it]] = value[it]; map<ll, int> mp; for (auto &x : a) { mp[x] = 0; } { int ij = 0; for (auto &it : mp) { it.second = ++ij; } } ll MN = a[n - 1]; int MX = 0; for (int i = 0; i < n; i++) { MX = max(MX, i - mp[a[i]]); } sol.push_back(MX + 1); } return sol; } vector<int> countScans(vector<int> a, vector<int> b, vector<int> c) { vector<ll> X, Z; for (auto &it : a) { X.push_back(it); } for (auto &it : c) { Z.push_back(it); } return innterCountScans(X, b, Z); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 49 ms | 344 KB | Output is correct |
2 | Correct | 134 ms | 384 KB | Output is correct |
3 | Correct | 983 ms | 528 KB | Output is correct |
4 | Correct | 984 ms | 644 KB | Output is correct |
5 | Correct | 946 ms | 524 KB | Output is correct |
6 | Correct | 747 ms | 644 KB | Output is correct |
7 | Correct | 877 ms | 528 KB | Output is correct |
8 | Correct | 877 ms | 528 KB | Output is correct |
9 | Correct | 923 ms | 524 KB | Output is correct |
10 | Correct | 818 ms | 520 KB | Output is correct |
11 | Correct | 754 ms | 520 KB | Output is correct |
12 | Correct | 764 ms | 648 KB | Output is correct |
13 | Correct | 746 ms | 512 KB | Output is correct |
14 | Correct | 728 ms | 524 KB | Output is correct |
15 | Correct | 694 ms | 652 KB | Output is correct |
16 | Correct | 695 ms | 524 KB | Output is correct |
17 | Correct | 715 ms | 524 KB | Output is correct |
18 | Correct | 736 ms | 460 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 49 ms | 344 KB | Output is correct |
2 | Correct | 134 ms | 384 KB | Output is correct |
3 | Correct | 983 ms | 528 KB | Output is correct |
4 | Correct | 984 ms | 644 KB | Output is correct |
5 | Correct | 946 ms | 524 KB | Output is correct |
6 | Correct | 747 ms | 644 KB | Output is correct |
7 | Correct | 877 ms | 528 KB | Output is correct |
8 | Correct | 877 ms | 528 KB | Output is correct |
9 | Correct | 923 ms | 524 KB | Output is correct |
10 | Correct | 818 ms | 520 KB | Output is correct |
11 | Correct | 754 ms | 520 KB | Output is correct |
12 | Correct | 764 ms | 648 KB | Output is correct |
13 | Correct | 746 ms | 512 KB | Output is correct |
14 | Correct | 728 ms | 524 KB | Output is correct |
15 | Correct | 694 ms | 652 KB | Output is correct |
16 | Correct | 695 ms | 524 KB | Output is correct |
17 | Correct | 715 ms | 524 KB | Output is correct |
18 | Correct | 736 ms | 460 KB | Output is correct |
19 | Execution timed out | 9017 ms | 1260 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 9035 ms | 2744 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 49 ms | 344 KB | Output is correct |
2 | Correct | 134 ms | 384 KB | Output is correct |
3 | Correct | 983 ms | 528 KB | Output is correct |
4 | Correct | 984 ms | 644 KB | Output is correct |
5 | Correct | 946 ms | 524 KB | Output is correct |
6 | Correct | 747 ms | 644 KB | Output is correct |
7 | Correct | 877 ms | 528 KB | Output is correct |
8 | Correct | 877 ms | 528 KB | Output is correct |
9 | Correct | 923 ms | 524 KB | Output is correct |
10 | Correct | 818 ms | 520 KB | Output is correct |
11 | Correct | 754 ms | 520 KB | Output is correct |
12 | Correct | 764 ms | 648 KB | Output is correct |
13 | Correct | 746 ms | 512 KB | Output is correct |
14 | Correct | 728 ms | 524 KB | Output is correct |
15 | Correct | 694 ms | 652 KB | Output is correct |
16 | Correct | 695 ms | 524 KB | Output is correct |
17 | Correct | 715 ms | 524 KB | Output is correct |
18 | Correct | 736 ms | 460 KB | Output is correct |
19 | Execution timed out | 9017 ms | 1260 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |