oj.uz

Submission #756216

# Submission time Handle Problem Language Result Execution time Memory
756216 2023-06-11T10:13:29 Z Alkarat Table Tennis (info1cup20_tabletennis) C++14
87 / 100
 3000 ms 4596 KB 
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int n,k,a[N];
vector<int>g;
map<int,int>ck;
bool check(int l,int r)
{
    int sum=a[l]+a[r];
    g.clear();
    while(l<r)
    {
        if(a[l]+a[r]==sum) 
        {
            g.push_back(a[l]);
            g.push_back(a[r]);
            l++;
            r--;
        }
        else if(a[l]+a[r]>sum) r--;
        else l++;
        if(g.size()==n)
        {
            sort(g.begin(),g.end());
            for(int e:g) cout<<e<<" ";
            return 1;
        }
    }
    return 0;
}
int 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];
    for(int i=1; i<=k+1; i++) for(int j=n+k; j>=i+n-1; j--) if(check(i,j)) return 0;
}

Compilation message

tabletennis.cpp: In function 'bool check(int, int)':
tabletennis.cpp:22:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   22 |         if(g.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 356 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 5 ms 720 KB Output is correct
2 Correct 35 ms 3100 KB Output is correct
3 Correct 32 ms 4548 KB Output is correct
4 Correct 32 ms 4552 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 3024 KB Output is correct
2 Correct 34 ms 4552 KB Output is correct
3 Correct 34 ms 4500 KB Output is correct
4 Correct 37 ms 4500 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 328 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 1 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 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 2 ms 340 KB Output is correct
3 Correct 1 ms 344 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 183 ms 3152 KB Output is correct
3 Correct 37 ms 4540 KB Output is correct
4 Correct 74 ms 4532 KB Output is correct
5 Correct 34 ms 4564 KB Output is correct
6 Correct 46 ms 4596 KB Output is correct
7 Correct 66 ms 4540 KB Output is correct
8 Correct 33 ms 4500 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 3038 ms 892 KB Time limit exceeded
3 Halted 0 ms 0 KB -