oj.uz

Submission #370331

# Submission time Handle Problem Language Result Execution time Memory
370331 2021-02-23T19:35:26 Z A_D Table Tennis (info1cup20_tabletennis) C++14
100 / 100
 402 ms 45016 KB 
#include <bits/stdc++.h>
#define int long long
#define ii pair<int,int>
#define F first
#define S second
#define du long double
using namespace std;
const int N=1e6+100;
int a[N];
vector<int> vec;
map<int,int> mp;
vector<int> v;
int n,m,k;
int ok(int v)
{
    int l=1,r=m;
    while(l<r){
        int u=a[l]+a[r];
//        cout<<l<<" "<<r<<endl;
  //      cout<<u<<" "<<v<<endl;
        if(u==v){
            vec.push_back(a[l]);
            vec.push_back(a[r]);
            l++;
            r--;
        }
        else if(u<v)l++;
        else r--;
    }
    //for(auto x:vec)cout<<x<<" ";cout<<endl;
    while(vec.size()>n)vec.pop_back();
    return vec.size()==n;
}
main()
{
    cin>>n>>k;
    m=n+k;
    for(int i=1;i<=m;i++)scanf("%lld",&a[i]);
    if(m<=4*k){
        for(int i=1;i<=k+1;i++){
            for(int j=n;j<=m;j++){
                if(ok(a[i]+a[j])){
                    sort(vec.begin(),vec.end());
                    for(auto x:vec){
                        printf("%lld ",x);
                    }
                    return 0;
                }
                else{
                    vec.clear();
                }
            }
        }
    }
    else{
        for(int i=1;i<=2*k;i++){
            for(int j=n-k;j<=m;j++){
                mp[a[i]+a[j]]++;
            }
        }
        for(auto x:mp){
            if(x.S>=k){
                v.push_back(x.F);
            }
        }
        for(auto x:v){
            if(ok(x)){
                sort(vec.begin(),vec.end());
                for(auto y:vec){
                    printf("%lld ",y);
                }
                return 0;
            }
            else{
                vec.clear();
            }
        }
    }
}

Compilation message

tabletennis.cpp: In function 'long long int ok(long long int)':
tabletennis.cpp:31:21: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   31 |     while(vec.size()>n)vec.pop_back();
      |           ~~~~~~~~~~^~
tabletennis.cpp:32:22: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   32 |     return vec.size()==n;
      |            ~~~~~~~~~~^~~
tabletennis.cpp: At global scope:
tabletennis.cpp:34:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   34 | main()
      |      ^
tabletennis.cpp: In function 'int main()':
tabletennis.cpp:38:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   38 |     for(int i=1;i<=m;i++)scanf("%lld",&a[i]);
      |                          ~~~~~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1128 KB Output is correct
2 Correct 52 ms 5896 KB Output is correct
3 Correct 50 ms 5744 KB Output is correct
4 Correct 51 ms 5736 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 5776 KB Output is correct
2 Correct 58 ms 5872 KB Output is correct
3 Correct 49 ms 5852 KB Output is correct
4 Correct 58 ms 5852 KB Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 492 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 49 ms 5860 KB Output is correct
3 Correct 50 ms 5724 KB Output is correct
4 Correct 50 ms 5724 KB Output is correct
5 Correct 51 ms 5724 KB Output is correct
6 Correct 49 ms 5852 KB Output is correct
7 Correct 50 ms 5852 KB Output is correct
8 Correct 50 ms 5724 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 394 ms 42588 KB Output is correct
3 Correct 402 ms 45016 KB Output is correct
4 Correct 267 ms 39516 KB Output is correct
5 Correct 161 ms 15016 KB Output is correct
6 Correct 88 ms 6248 KB Output is correct
7 Correct 271 ms 35168 KB Output is correct
8 Correct 246 ms 38232 KB Output is correct