oj.uz

Submission #675183

# Submission time Handle Problem Language Result Execution time Memory
675183 2022-12-27T02:30:47 Z hotboy2703 Table Tennis (info1cup20_tabletennis) C++14
100 / 100
 344 ms 32384 KB 
#include<bits/stdc++.h>
using namespace std;
int a[151000];
int n,k;
bool check(int x){
    int l = 1;
    int r = n;
    int cnt = 0;
    while (l < r){
        if (a[l] + a[r] > x){cnt++;r--;}
        else if (a[l] + a[r] < x){l++;cnt++;}
        else{l++;r--;}
        if (cnt > k)return 0;
    }
    vector <int> ans;
    l = 1;
    r = n;
    while (l < r){
        if (a[l] + a[r] > x){r--;}
        else if (a[l] + a[r] < x){l++;}
        else{if (ans.size() < n - k){ans.push_back(a[l]);ans.push_back(a[r]);}l++;r--;}
    }
    sort(ans.begin(),ans.end());
    for (auto y:ans)cout<<y<<' ';
    cout<<'\n';
    return 1;
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
    cin>>n>>k;n += k;
    for (int i = 1;i <= n;i ++){
        cin>>a[i];
    }
    map <int,int> cnt;
    for (int i = 1;i <= 2 * k &&  i <= n;i ++){
        for (int j = max(1,n - 2 * k + 1);j <= n;j ++){
            cnt[a[i] + a[j]]++;
        }
    }
    for (auto x:cnt){
        if (x.second >= k || x.second >= n - k){
            if (check(x.first))return 0;
        }
    }
}

Compilation message

tabletennis.cpp: In function 'bool check(int)':
tabletennis.cpp:21:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   21 |         else{if (ans.size() < n - k){ans.push_back(a[l]);ans.push_back(a[r]);}l++;r--;}
      |                  ~~~~~~~~~~~^~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 724 KB Output is correct
2 Correct 38 ms 3088 KB Output is correct
3 Correct 30 ms 3072 KB Output is correct
4 Correct 31 ms 3048 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 3056 KB Output is correct
2 Correct 33 ms 3052 KB Output is correct
3 Correct 34 ms 3088 KB Output is correct
4 Correct 35 ms 3048 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 5 ms 1004 KB Output is correct
3 Correct 4 ms 980 KB Output is correct
4 Correct 4 ms 980 KB Output is correct
5 Correct 4 ms 980 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 31 ms 3168 KB Output is correct
3 Correct 31 ms 3060 KB Output is correct
4 Correct 31 ms 3120 KB Output is correct
5 Correct 36 ms 3012 KB Output is correct
6 Correct 31 ms 3060 KB Output is correct
7 Correct 30 ms 3080 KB Output is correct
8 Correct 30 ms 3008 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 4552 KB Output is correct
2 Correct 344 ms 30636 KB Output is correct
3 Correct 243 ms 32384 KB Output is correct
4 Correct 212 ms 28312 KB Output is correct
5 Correct 93 ms 9948 KB Output is correct
6 Correct 53 ms 3296 KB Output is correct
7 Correct 179 ms 25060 KB Output is correct
8 Correct 164 ms 27240 KB Output is correct