oj.uz

Submission #865901

# Submission time Handle Problem Language Result Execution time Memory
865901 2023-10-25T02:50:52 Z Darren0724 Table Tennis (info1cup20_tabletennis) C++17
87 / 100
 3000 ms 5568 KB 
#include<bits/stdc++.h>
using namespace std;
mt19937 rnd(time(0));

int main(){
    int n,k;cin>>n>>k;
    vector<int> v(n+k);
    for(int i=0;i<n+k;i++){
        cin>>v[i];
    }
    int flag=0;
    auto check=[&](int p)->void {
        int j=n+k-1;
        int cnt=0;
        vector<int> ans;
        for(int i=0;i<n+k;i++){
            while(i<j&&v[i]+v[j]>p){
                j--;
            }
            if(i>=j){
                break;
            }
            if(i<j&&v[i]+v[j]==p){
                ans.push_back(v[i]);
                ans.push_back(v[j]);
                cnt+=2;
                j--;
            }
        }
        //cout<<ans.size()<<endl;
        if(cnt>=n){
            sort(ans.begin(),ans.begin()+n);
            for(int i=0;i<n;i++){
                cout<<ans[i]<<' ';
            }
            cout<<endl;
            flag=1;
        }
    };
    for(int i=0;i<min(k+1,n+k);i++){
        for(int j=max(0,n-10);j<n+k;j++){
            check(v[i]+v[j]);
            if(flag){
                return 0;
            }
        }
    }
    assert(false);

}

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 828 KB Output is correct
2 Correct 67 ms 3012 KB Output is correct
3 Correct 60 ms 4452 KB Output is correct
4 Correct 61 ms 4548 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 3208 KB Output is correct
2 Correct 58 ms 3016 KB Output is correct
3 Correct 66 ms 3104 KB Output is correct
4 Correct 61 ms 4552 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 480 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 324 ms 3192 KB Output is correct
3 Correct 58 ms 4460 KB Output is correct
4 Correct 100 ms 4548 KB Output is correct
5 Correct 59 ms 4552 KB Output is correct
6 Correct 75 ms 5568 KB Output is correct
7 Correct 94 ms 4584 KB Output is correct
8 Correct 59 ms 4460 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Execution timed out 3075 ms 860 KB Time limit exceeded
3 Halted 0 ms 0 KB -