QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#786263 | #9733. Heavy-light Decomposition | ZhZlzc | WA | 5ms | 3892kb | C++20 | 1.0kb | 2024-11-26 20:56:21 | 2024-11-26 20:56:22 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
using namespace std;
using LL = long long;
typedef pair<int, int> PII;
const int N = 1e5 + 10, M = 5010, mod = 1e9 + 7;
const int inf = 1e18;
void solve(){
int n, k;
cin >> n >> k;
vector <PII> a(k + 1);
vector <int> fa(n + 1);
for(int i = 1; i <= k; i++){
cin >> a[i].x >> a[i].y;
for(int j = a[i].x + 1; j <= a[i].y; j++){
fa[j] = j - 1;
}
}
sort(a.begin() + 1, a.end(), [&](PII a, PII b){
return (a.y - a.x) > (b.y - b.x);
});
if(k == 1){
fa[a[1].x] = 0;
for(int i = 1; i <= n; i++) cout << fa[i] << " \n"[ i == n ];
return;
}
if(a[1].y - a[1].x == a[2].y - a[2].x) cout << "IMPOSSIBLE\n";
else{
//cout << a[1].x << "\n";
fa[a[1].x] = 0;
for(int i = 2; i <= k; i++){
fa[a[i].x] = a[1].x;
}
for(int i = 1; i <= n; i++){
cout << fa[i] << " \n"[ i == n ];
}
}
}
signed main() {
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int T = 1;
cin >> T;
while(T--) {
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3556kb
input:
3 12 5 1 5 9 11 7 8 6 6 12 12 4 3 1 1 4 4 2 3 2 2 1 1 2 2
output:
0 1 2 3 4 1 1 7 1 9 10 1 2 0 2 2 IMPOSSIBLE
result:
ok Correct. (3 test cases)
Test #2:
score: 0
Accepted
time: 5ms
memory: 3892kb
input:
10 1 1 1 1 100000 1 1 100000 12 4 1 3 4 6 7 9 10 12 6 3 4 6 2 3 1 1 8999 3 1 3000 3001 6000 6001 8999 14 4 1 3 4 6 7 10 11 14 17 5 1 3 4 6 7 10 11 14 15 17 19999 2 1 9999 10000 19999 1 1 1 1 5 3 1 1 2 3 4 5
output:
0 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 ...
result:
ok Correct. (10 test cases)
Test #3:
score: -100
Wrong Answer
time: 1ms
memory: 3772kb
input:
5 11 5 1 3 4 6 7 8 9 10 11 11 39998 4 1 10000 10001 20000 20001 30000 30001 39998 49000 5 1 10000 39999 49000 10001 20000 20001 30000 30001 39998 16 5 1 1 2 3 4 6 7 11 12 16 10 5 1 2 3 4 5 6 7 8 9 10
output:
IMPOSSIBLE IMPOSSIBLE IMPOSSIBLE IMPOSSIBLE IMPOSSIBLE
result:
wrong answer Case 1, jury find a solution while participant not. (test case 1)