oj.uz

Submission #675080

# Submission time Handle Problem Language Result Execution time Memory
675080 2022-12-27T01:46:02 Z jahsdwaijsd Table Tennis (info1cup20_tabletennis) C++14
100 / 100
 79 ms 7360 KB 
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
*/
#include <bits/stdc++.h>
#define taskname "bai3"
#define all(x) x.begin(), x.end()
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
using namespace std;

const int mxN = 2e5 + 5;
const int base = 1e9 + 1;
const int mod = 1e9 + 7;
const ll oo = 1e18;

int n, k, a[mxN];
map<int, int> s;

bool test(int l, int r) {
    vector<int> bruh, bruh1;
    int cnt = n + k - r + l - 1;
    int sum = a[l] + a[r];
    if(s.find(sum) != s.end()) return false;
    else s[sum]++;
    int actual_count = 0;
    while(l < r) {
        int tmp = a[l] + a[r];
        if(tmp == sum) {
            bruh.pb(a[l]);
            bruh1.pb(a[r]);
            ++l; --r;
            actual_count += 2;
        }
        else {
            ++cnt;
            if(tmp > sum) --r;
            else ++l;
        }
        if(cnt > k) return false;
        if(actual_count == n) {
            for(int i = 0; i * 2 < actual_count; ++i) cout << bruh[i] << " ";
            for(int i = (actual_count >> 1) - 1; i >= 0; --i) cout << bruh1[i] << " ";
            cout << endl;
            return true;
        }
    }
    for(int i = 0; i * 2 < actual_count; ++i) cout << bruh[i] << " ";
    for(int i = (actual_count >> 1) - 1; i >= 0; --i) cout << bruh1[i] << " ";
    cout << endl;
    return true;
}

void solve() {
    cin >> n >> k;
    for(int i = 1; i <= n + k; ++i) cin >> a[i];
    for(int i = 1; i <= k + 1; ++i) {
        for(int j = n + k; j >= n + i - 1; --j) {
            if(test(i, j)) return;
        }
    }
}

signed main() {
#ifdef CDuongg
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
    auto end = chrono::high_resolution_clock::now();
    cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
    cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif

}

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 36 ms 3196 KB Output is correct
3 Correct 27 ms 3136 KB Output is correct
4 Correct 25 ms 3212 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 3136 KB Output is correct
2 Correct 25 ms 3220 KB Output is correct
3 Correct 31 ms 3228 KB Output is correct
4 Correct 29 ms 3160 KB Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 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 340 KB Output is correct
3 Correct 1 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 25 ms 3144 KB Output is correct
3 Correct 26 ms 3108 KB Output is correct
4 Correct 28 ms 3264 KB Output is correct
5 Correct 26 ms 3128 KB Output is correct
6 Correct 26 ms 3144 KB Output is correct
7 Correct 25 ms 3144 KB Output is correct
8 Correct 25 ms 3128 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 79 ms 6824 KB Output is correct
3 Correct 28 ms 4544 KB Output is correct
4 Correct 69 ms 7360 KB Output is correct
5 Correct 28 ms 4568 KB Output is correct
6 Correct 31 ms 4700 KB Output is correct
7 Correct 52 ms 5928 KB Output is correct
8 Correct 34 ms 4520 KB Output is correct