oj.uz

Submission #865871

# Submission time Handle Problem Language Result Execution time Memory
865871 2023-10-25T01:26:17 Z Darren0724 Table Tennis (info1cup20_tabletennis) C++17
49 / 100
 3000 ms 3252 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=1;
    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=0;
        }
    };
    while(flag){
        int i=rnd()%(n+k);
        int j=rnd()%(n+k);
        check(v[i]+v[j]);
    }

}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 344 KB Output is correct
2 Correct 18 ms 480 KB Output is correct
3 Correct 16 ms 472 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1082 ms 1248 KB Output is correct
2 Execution timed out 3014 ms 2388 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3059 ms 3252 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
15.0 / 15.0

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

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 8 ms 484 KB Output is correct
3 Correct 15 ms 460 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 8 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #7
0 / 15.0

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

Subtask #8
0 / 13.0

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