QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#747205 | #9574. Strips | ucup-team1769# | WA | 51ms | 3604kb | C++14 | 1.9kb | 2024-11-14 16:34:44 | 2024-11-14 16:34:47 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
void sol()
{
int n, m, k, w;
cin >> n >> m >> k >> w;
// poi, color R=1 B=2
vector<pair<int, int>> vec;
for (int i = 0; i < n; i++)
{
int p;
cin >> p;
vec.push_back({p, 1});
}
for (int i = 0; i < m; i++)
{
int p;
cin >> p;
vec.push_back({p, 2});
}
sort(vec.begin(), vec.end());
vec.push_back({w + 1, 2});
int beg_poi = 1;
int gai_poi = -1;
int gai_num = 0;
vector<int> ans_vec;
for (int i = 0; i < vec.size(); i++)
{
if(vec[i].second == 2)
{
if(vec[i].first <= gai_poi + k)
{
if(gai_num * k > vec[i].first - beg_poi)
{
cout << "-1\n";
return;
}
else
{
int eind = vec[i].first;
for (int j = 1; j <= gai_num; j++)
{
if(ans_vec[ans_vec.size() - j] + k > eind)
{
ans_vec[ans_vec.size() - j] = eind - k;
eind -= k;
}
}
gai_poi = -1;
gai_num = 0;
}
}
}
else
{
if(gai_poi == -1 || gai_poi + k <= vec[i].first)
{
gai_poi = vec[i].first;
ans_vec.push_back(vec[i].first);
gai_num++;
}
}
}
cout << ans_vec.size() << "\n";
for (int i = 0; i < ans_vec.size(); i++)
{
cout << ans_vec[i] << " ";
}
cout << "\n";
}
int main()
{
int T;
cin >> T;
while (T--)
{
sol();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3604kb
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:
4 2 7 10 14 -1 2 1 5 -1
result:
ok ok 4 cases (4 test cases)
Test #2:
score: -100
Wrong Answer
time: 51ms
memory: 3552kb
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 7 (test case 49)