oj.uz

Submission #685277

# Submission time Handle Problem Language Result Execution time Memory
685277 2023-01-23T21:26:27 Z tudor Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 173 ms 4436 KB 
#include <iostream>

using namespace std;
const int nmax = 150000;
const int kmax = 400;

int a[nmax + kmax];
int n, k;

pair < int, int > ans[nmax / 2];

int check ( int sum ) {
    int st = 0, dr = n + k - 1, cnt = 0;
    while ( st < dr && cnt < n / 2 && ( dr - st + 1 ) / 2 + cnt >= n / 2 ) {
        if ( a[st] + a[dr] == sum )
            ans[cnt++] = { st++, dr-- };
        else if ( a[st] + a[dr] < sum )
            st++;
        else dr--;
    }
    return cnt >= n / 2;
}


int main() {
    cin >> n >> k;

    for ( int i = 0; i < n + k; i++ )
        cin >> a[i];

    bool ok = false;
    for ( int i = 0; i <= k && !ok; i++ )
        for ( int j = n - 1; j < n + k && !ok; j++ )
            if ( i < j && check ( a[i] + a[j] ) )
                ok = true;

    for ( int i = 0; i < n / 2; i++ )
        cout << a[ans[i].first] << ' ';
    for ( int i = n / 2 - 1; i >= 0; i-- )
        cout << a[ans[i].second] << ' ';


    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 2 ms 292 KB Output is correct
3 Correct 2 ms 340 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 836 KB Output is correct
2 Correct 73 ms 4368 KB Output is correct
3 Correct 69 ms 4324 KB Output is correct
4 Correct 70 ms 4304 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 4264 KB Output is correct
2 Correct 71 ms 4432 KB Output is correct
3 Correct 69 ms 4308 KB Output is correct
4 Correct 72 ms 4312 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 308 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 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 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 1 ms 340 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 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 76 ms 4348 KB Output is correct
3 Correct 70 ms 4300 KB Output is correct
4 Correct 72 ms 4352 KB Output is correct
5 Correct 69 ms 4300 KB Output is correct
6 Correct 70 ms 4436 KB Output is correct
7 Correct 73 ms 4412 KB Output is correct
8 Correct 68 ms 4272 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 173 ms 4356 KB Output is correct
3 Correct 70 ms 4404 KB Output is correct
4 Correct 122 ms 4428 KB Output is correct
5 Correct 75 ms 4220 KB Output is correct
6 Correct 75 ms 4324 KB Output is correct
7 Correct 162 ms 4268 KB Output is correct
8 Correct 74 ms 4312 KB Output is correct