Submission #791929

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
791929	2023-07-24T12:38:49 Z	Cookie	Table Tennis (info1cup20_tabletennis)	C++14	87 / 100	3000 ms	4528 KB

tabletennis

#include<bits/stdc++.h>
#include<fstream>
#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("avx2")
using namespace std;
//ifstream fin("FEEDING.INP");
//ofstream fout("FEEDING.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const ll mxn = 2e5 + 5, base = 972663749;
const ll mod = 911382323, mxv = 1e9 + 1;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rr(ll l, ll r){
    return(uniform_int_distribution<ll>(l, r)(rng));
}
 
int n, k;
int a[mxn + 1];
vt<int>seg;
int check(int v, bool trace = 0){
    int l = 1, r = n + k, cnt = 0;
    while(l < r){
        if(a[l] + a[r] == v){
            if(trace && sz(seg) != n){
                seg.pb(a[l]); seg.pb(a[r]);
            }
            cnt++;
            l++; r--;
        }else if(a[l] + a[r] > v){
            r--;
        }else{
            l++;
        }
    }
    return(cnt);
}
signed main()
{
     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> k;
    for(int i = 1; i <= n + k; i++)cin >> a[i];
    sort(a + 1, a + n + k + 1);
   
    for(int tol = 1; tol <= k + 1; tol++){
        for(int tor = max(n, tol + 1); tor <= n + k; tor++){
        if(check(a[tol] + a[tor]) >= n / 2){
            check(a[tol] + a[tor], 1);
            break;
        }
        }
    }
    sort(seg.begin(), seg.end());
    for(auto i: seg){
        cout << i << " ";
    }
    return(0);
}

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	4 ms	724 KB	Output is correct
2	Correct	27 ms	3104 KB	Output is correct
3	Correct	27 ms	3016 KB	Output is correct
4	Correct	27 ms	3144 KB	Output is correct

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	28 ms	3064 KB	Output is correct
2	Correct	33 ms	3052 KB	Output is correct
3	Correct	34 ms	3052 KB	Output is correct
4	Correct	30 ms	3140 KB	Output is correct

Subtask #4
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	212 KB	Output is correct
2	Correct	3 ms	212 KB	Output is correct
3	Correct	3 ms	332 KB	Output is correct
4	Correct	2 ms	328 KB	Output is correct
5	Correct	4 ms	212 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	1 ms	212 KB	Output is correct
2	Correct	2 ms	340 KB	Output is correct
3	Correct	2 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	212 KB	Output is correct
2	Correct	257 ms	3064 KB	Output is correct
3	Correct	96 ms	4484 KB	Output is correct
4	Correct	64 ms	4476 KB	Output is correct
5	Correct	74 ms	4448 KB	Output is correct
6	Correct	41 ms	4528 KB	Output is correct
7	Correct	70 ms	4516 KB	Output is correct
8	Correct	61 ms	4496 KB	Output is correct

Subtask #8
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	128 ms	212 KB	Output is correct
2	Execution timed out	3083 ms	852 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Submission #791929

Compilation message