QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#756654#9733. Heavy-light Decompositionhxsj#WA 3ms3680kbC++142.2kb2024-11-16 21:25:562024-11-16 21:25:56

Judging History

你现在查看的是最新测评结果

  • [2024-11-16 21:25:56]
  • 评测
  • 测评结果:WA
  • 用时:3ms
  • 内存:3680kb
  • [2024-11-16 21:25:56]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
       
        int n, k;
        cin >> n >> k;
        vector<array<int, 3>> seg(k);
        vector<int> ans(n + 1);
        map<int, int> c;
        for (int i = 0; i < k; i ++ ){
            cin >> seg[i][1] >> seg[i][2];
            seg[i][0] = seg[i][1] - seg[i][2];
            c[seg[i][0]]++;
        }
        sort(seg.begin(),seg.end());
        if(seg[0][0] == 0 || k == n){
            cout << "IMPOSSIBLE" << endl;
            continue;
        }
        int r = seg[0][1];
        //cout << c[seg[0][0]] << "!";
        if(c[seg[0][0]] == 1){
            for (int i = 0; i < k; i ++ ){
                for (int j = seg[i][1]; j <= seg[i][2]; j ++ ){
                    if(j == r){
                        ans[j] = 0;
                        continue;
                    }
                    if(j == seg[i][1]){
                        ans[j] = r;
                        continue;
                    }        
                    ans[j] = j - 1;
                }
            }            
        }
        else{
            int ok = 0;
            for(auto [x, y] : c){
                if(-x <= 2 - seg[0][0]){
                    ok = 1;
                    break;
                }
            }
            if(ok == 0){
                cout << "IMPOSSIBLE" << endl;
                continue;                
            }
            for (int i = 0; i < k - 1; i ++ ){
                for (int j = seg[i][1]; j <= seg[i][2]; j ++ ){
                    if(j == r){
                        ans[j] = 0;
                        continue;
                    }
                    if(j == seg[i][1]){
                        ans[j] = r;
                        continue;
                    }        
                    ans[j] = j - 1;
                }
            }        
            for (int i = seg[k - 1][1]; i <= seg[k - 1][2]; i ++ ){
                ans[i] = seg[0][1] + 1;
            }
        }

        for (int i = 1; i <= n; i ++ ) cout << ans[i] << " ";
        cout << endl;
    }
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3552kb

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: -100
Wrong Answer
time: 3ms
memory: 3680kb

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:

IMPOSSIBLE
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...

result:

wrong answer Case 1, jury find a solution while participant not. (test case 1)