QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#612441#6429. Let's Play Curlingzyq_313#WA 93ms3928kbC++141.5kb2024-10-05 11:09:092024-10-05 11:09:10

Judging History

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

  • [2024-10-05 11:09:10]
  • 评测
  • 测评结果:WA
  • 用时:93ms
  • 内存:3928kb
  • [2024-10-05 11:09:09]
  • 提交

answer

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>

using namespace std;
const int N = 1e5 + 5;
int n, m;

void solve(){
    
    cin >> n >> m;
    vector<int> a(n, 0), b(m, 0);
    for (int i = 0; i < n; i ++) cin >> a[i];
    for (int i = 0; i < m; i ++) cin >> b[i];
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

    int ans = 0;

    // auto pos1 = upper_bound(a.begin(), a.end(), 4);

    // cout << *pos1 << endl;


    for (int i = 0; i < m - 1; i ++){
        int l = b[i], r = b[i + 1];
        if (l == r) continue;
        // cout << l << ' ' << r << ' ';
        auto pos1 = upper_bound(a.begin(), a.end(), l);
       
        
        if (pos1 == a.end()){
            continue;
        }
        int p1 = pos1 - a.begin(), p2 = 0;

        auto pos2 = lower_bound(a.begin(), a.end(), r);


        if (pos2 == a.end()){
            p2 = n - 1;
            ans = max(ans, p2 - p1 + 1);
            continue;

        }

        if (*pos2 >= r){
            pos2 --;
        }
        p2 = pos2 - a.begin();

 
        ans = max(ans, p2 - p1 + 1);
        // cout << p1 << ' ' << p2 << ' ' << ans << endl;
    }

    // cout << "dwnoidnwon" << endl;

    if (ans){
        cout << ans << endl;
    }else{
        cout << "Impossible\n";
    }

    

}


int 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: 3528kb

input:

3
2 2
2 3
1 4
6 5
2 5 3 7 1 7
3 4 3 1 10
1 1
7
7

output:

2
3
Impossible

result:

ok 3 lines

Test #2:

score: -100
Wrong Answer
time: 93ms
memory: 3928kb

input:

5553
12 19
8 8 11 18 12 9 15 38 6 32 30 30
17 28 33 2 37 20 11 38 36 18 18 30 20 33 13 31 33 37 8
12 6
7 12 14 2 19 2 17 7 4 20 1 13
7 18 23 22 1 16
8 7
5 2 4 2 4 5 8 12
13 16 6 6 5 16 11
5 7
5 13 3 8 3
11 6 9 11 13 8 11
17 19
944782509 244117333 140979583 661724696 617847780 321687699 418677763 725...

output:

1
3
1
Impossible
4
8
11
4
2
4
5
2
4
1
4
3
2
4
2
3
5
4
1
4
9
1
3
9
Impossible
2
1
1
5
1
2
Impossible
4
4
4
4
11
4
5
Impossible
3
5
4
4
5
Impossible
3
2
4
5
5
2
2
8
3
2
3
1
2
7
2
5
3
2
1
2
5
3
6
3
1
4
Impossible
1
Impossible
3
4
Impossible
9
1
2
Impossible
16
5
Impossible
4
3
4
3
4
3
1
1
3
3
2
2
2
5
2...

result:

wrong answer 3rd lines differ - expected: '4', found: '1'