oj.uz

Submission #718284

# Submission time Handle Problem Language Result Execution time Memory
718284 2023-04-03T19:39:21 Z vjudge1 Table Tennis (info1cup20_tabletennis) C++17
87 / 100
 3000 ms 3240 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define all(x) x.begin(),x.end()
const int MOD = 1e9 + 7, SZ = 1e5 + 10, MX = 1e9;
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, k;
    cin >> n >> k;
    int arr[n + k];
    for(int &i : arr)
        cin >> i;
    for(int i=0;i<=k;i++){
        for(int j=0;j<=k-i;j++){
            vector<int> ans;
            int l = i, r = n + k - j - 1, y = arr[i] + arr[n + k - j - 1];
            while(l < r){
                ll x = arr[l] + arr[r];
                if(ans.size() == n)
                    break;
                if(x == y){
                    ans.push_back(arr[l]);
                    ans.push_back(arr[r]);
                }
                if(x >= y)
                    r--;
                if(x <= y)
                    l++;
            }
            if(ans.size() == n){
                sort(all(ans));
                for(int x : ans)
                    cout << x << ' ';
                return 0;
            }
        }
    }
    return 0;
}
// https://www.youtube.com/watch?v=zL32whN6p0A&ab_channel=HeidiAdel-CartoonWorld

Compilation message

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:20:31: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |                 if(ans.size() == n)
      |                    ~~~~~~~~~~~^~~~
tabletennis.cpp:31:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   31 |             if(ans.size() == n){
      |                ~~~~~~~~~~~^~~~

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 31 ms 3016 KB Output is correct
3 Correct 31 ms 3060 KB Output is correct
4 Correct 31 ms 3076 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 3028 KB Output is correct
2 Correct 35 ms 3240 KB Output is correct
3 Correct 34 ms 3128 KB Output is correct
4 Correct 32 ms 3016 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 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 316 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 0 ms 212 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 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 160 ms 3112 KB Output is correct
3 Correct 36 ms 3016 KB Output is correct
4 Correct 55 ms 3020 KB Output is correct
5 Correct 34 ms 3016 KB Output is correct
6 Correct 46 ms 3016 KB Output is correct
7 Correct 56 ms 3056 KB Output is correct
8 Correct 31 ms 2976 KB Output is correct

Subtask #8
0 / 13.0

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