Submission #675166

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
675166	2022-12-27T02:20:54 Z	uylulu	Table Tennis (info1cup20_tabletennis)	C++17	100 / 100	213 ms	15172 KB

tabletennis

#include <bits/stdc++.h>
using namespace std;

#define ld long double
#define int long long
#define endl "\n"

const int N = 3e5,K = 400;

int num[N + 1],n,k,len;
vector<pair<int,int>> res;

map<int,int> mp;

inline void build(int sum,int l,int r) {

    res.clear();
    int curr = r - 1,lim = k - (l - 1 + len - r);
    for(int i = l + 1;i < curr;i++) {
        if(lim < 0) return;

        while(curr > i && num[i] + num[curr] > sum) {
            curr--;
            lim--;
        }

        if(num[i] + num[curr] == sum) {
            res.push_back({num[i],num[curr]});
            curr--;
        } else {
            lim--;
        }
        if(lim < 0) return;

    }   
    if((int)res.size() < n/2 - 1) {
        return;
    }
    vector<int> kq;
    for(int i = 0;i < n/2 - 1;i++) {
        kq.push_back(res[i].first);
        kq.push_back(res[i].second);
    }
    kq.push_back(num[l]);
    kq.push_back(num[r]);
    sort(kq.begin(),kq.end());


    for(auto u : kq) {
        cout<<u<<" ";
    }

    exit(0);
}

signed main() {
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // freopen("in.txt","r",stdin);
    // freopen("out.txt","w",stdout);

    cin>>n>>k;
    len = n + k;

    for(int i = 1;i <= len;i++) {
        cin>>num[i];
        mp[num[i]] = i;
    }

    for(int i = 1;i <= k + 1 && i <= len;i++) {
        int left = len - (k - i + 1);
        for(int j = left;j <= len;j++) {

            build(num[i] + num[j],i,j);

        }
    }

    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	2384 KB	Output is correct
2	Correct	74 ms	15068 KB	Output is correct
3	Correct	71 ms	15084 KB	Output is correct
4	Correct	65 ms	15140 KB	Output is correct

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	65 ms	15116 KB	Output is correct
2	Correct	69 ms	15172 KB	Output is correct
3	Correct	64 ms	15092 KB	Output is correct
4	Correct	63 ms	15128 KB	Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
9.0 / 9.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct

Subtask #6
14.0 / 14.0

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

Subtask #7
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	86 ms	15044 KB	Output is correct
3	Correct	67 ms	15044 KB	Output is correct
4	Correct	62 ms	15112 KB	Output is correct
5	Correct	64 ms	15056 KB	Output is correct
6	Correct	76 ms	15104 KB	Output is correct
7	Correct	63 ms	15044 KB	Output is correct
8	Correct	66 ms	15148 KB	Output is correct

Subtask #8
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	77 ms	15172 KB	Output is correct
3	Correct	65 ms	15096 KB	Output is correct
4	Correct	73 ms	15084 KB	Output is correct
5	Correct	97 ms	15172 KB	Output is correct
6	Correct	213 ms	15156 KB	Output is correct
7	Correct	95 ms	15172 KB	Output is correct
8	Correct	61 ms	15072 KB	Output is correct

Submission #675166

Compilation message