oj.uz

답안 #865911

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
865911 2023-10-25T03:00:30 Z Darren0724 Table Tennis (info1cup20_tabletennis) C++17
87 / 100
 3000 ms 4964 KB 
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
mt19937 rnd(time(0));
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    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;
    unordered_set<int> s;
    auto check=[&](int p)->void {
        if(s.count(p)){
            return;
        }
        s.insert(p);
        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;
        }
    };
    while(!flag){
        int i=rnd()%(k+1);
        int j=n-1+rnd()%(k+1);
        check(v[i]+v[j]);
    }
    return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1116 KB Output is correct
2 Correct 27 ms 4432 KB Output is correct
3 Correct 28 ms 4048 KB Output is correct
4 Correct 28 ms 4128 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 4264 KB Output is correct
2 Correct 26 ms 4276 KB Output is correct
3 Correct 28 ms 4368 KB Output is correct
4 Correct 28 ms 4048 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 10 ms 784 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 10 ms 664 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 500 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 548 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #7
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 66 ms 4420 KB Output is correct
3 Correct 84 ms 4256 KB Output is correct
4 Correct 48 ms 4012 KB Output is correct
5 Correct 58 ms 4232 KB Output is correct
6 Correct 26 ms 4184 KB Output is correct
7 Correct 27 ms 4040 KB Output is correct
8 Correct 32 ms 4036 KB Output is correct

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 236 ms 4964 KB Output is correct
2 Execution timed out 3021 ms 2560 KB Time limit exceeded
3 Halted 0 ms 0 KB -