QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#790666	#9574. Strips	Sunwking	WA	40ms	3596kb	C++20	2.1kb	2024-11-28 14:31:52	2024-11-28 14:31:53

Judging History

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

[2024-11-28 14:31:53]
评测

测评结果：WA
用时：40ms
内存：3596kb

查看

[2024-11-28 14:31:52]
提交

answer

#include <bits/stdc++.h>

using namespace std;
using LL = long long;
using PII = pair<int , int>;

void solved() {
   int n , m , k , w;
   cin >> n >> m >> k >> w;

   map<int , int> mp;
   vector<int> a(n + m + 1);
   for(int i = 1 ; i <= n ; i ++ ){
       cin >> a[i];
       mp[a[i]] = 1;
   }
   for(int i = 1 ; i <= m ; i ++ ){
       cin >> a[i + n];
   }

    std::sort(a.begin(), a.end());
//    for(int i = 1 ; i <= n + m ; i ++ )
//        cout << a[i] << " \n"[i == n + m];
   vector<int> c;
   for(int i = 1 ; i <= n + m ; i ++ ){
       if(!mp[a[i]]) continue;
       int j = i , last = 0;
       while(j <= n + m && mp[a[j]]){
           if(a[j] > last) {
               last = a[j] + k - 1;
               c.push_back(a[j]);
           }
           j ++;
       }
       if(j <= n + m && last >= a[j]) {
           c[c.size() - 1] = a[j] - k;
           if(a[j] - k <= a[i - 1]){
               cout << "-1\n";
               return;
           }
           for (int z = c.size() - 2; z >= 0; z--)
               if (c[z] + k - 1 >= c[z + 1]) {
                   c[z] = c[z + 1] - k;
                   if (c[z] <= a[i - 1]) {
                       cout << "-1\n";
                       return;
                   }
               } else break;
       }else if(j == n + m + 1 && last > w){
           c[c.size() - 1] = w - k + 1;
//           if(w - k + 1 <= a[i - 1]){
//               cout << "-1\n";
//               return ;
//           }
           for (int z = c.size() - 2; z >= 0; z--)
               if (c[z] + k - 1 >= c[z + 1]) {
                   c[z] = c[z + 1] - k;
                   if (c[z] <= a[i - 1]) {
                       cout << "-1\n";
                       return;
                   }
               } else break;
       }
//       cout << i << " " << j << " " << last << "\n";
       i = j;
   }

   cout << c.size() << "\n";
   for(int x : c) cout << x << " ";
   cout << "\n";
}

int main(){

    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    cin >> t;

    while(t -- )
        solved();

    return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3556kb

input:

4
5 2 3 16
7 11 2 9 14
13 5
3 2 4 11
6 10 2
1 11
2 1 2 6
1 5
3
2 1 2 6
1 5
2

output:

result:

ok ok 4 cases (4 test cases)

Test #2:

score: -100

Wrong Answer

time: 40ms

memory: 3596kb

input:

11000
3 8 2 53
32 3 33
35 19 38 20 1 30 10 6
7 10 1 42
3 14 4 36 28 40 22
17 20 12 41 27 7 1 19 13 9
6 6 13 78
55 76 53 32 54 58
62 45 21 4 7 61
8 7 3 68
9 26 54 31 22 3 38 65
34 16 58 47 52 29 53
5 8 4 33
33 5 30 6 15
27 12 9 28 19 2 13 10
6 1 2 48
8 12 48 1 41 31
40
7 6 7 61
20 19 30 52 49 17 40
3...

output:

2
3 32 
7
3 4 14 22 28 36 40 
3
32 48 66 
8
3 9 22 26 31 38 54 65 
3
5 15 30 
6
1 8 12 31 41 47 
4
17 30 39 49 
2
52 67 
1
27 
1
22 
1
62 
5
24 33 43 48 60 
2
4 31 
3
11 20 31 
3
3 16 33 
3
25 30 42 
3
3 17 60 
4
1 11 21 33 
2
54 66 
3
50 59 65 
3
50 62 78 
1
81 
4
2 11 16 23 
5
3 7 17 36 49 
2
1 45...

result:

wrong answer There is at least one stripe covering black cell 80 (test case 464)