oj.uz

Submission #377643

# Submission time Handle Problem Language Result Execution time Memory
377643 2021-03-14T14:49:31 Z wildturtle Table Tennis (info1cup20_tabletennis) C++14
87 / 100
 3000 ms 52828 KB 
#include<bits/stdc++.h>
using namespace std;
long long a,b,c,d,i,e,f,g,n,m,k,l,cnt,A[500005];
map <long long,long long> mp,mp1;
vector <long long> v;
set <long long> st;
set <long long>::iterator it;
long long check(long long sum) {
    for(long long i=1;i<=n;i++) mp1[A[i]]++;
    cnt=0; v.clear();
    for(long long i=1;i<=n;i++) {
        if(mp1[A[i]]==0) continue;
        mp1[A[i]]--;
        if(mp1[sum-A[i]]>=1) {
            cnt++; mp1[sum-A[i]]=0; 
            v.push_back(A[i]);
            v.push_back(sum-A[i]);
            if(cnt==(n-k)/2) break;
        }
    }
    mp1.clear();
    if(cnt>=(n-k)/2) return 1;
    else return 0;
}
int main() {
    ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n>>k;
    n+=k;
    for(long long i=1;i<=n;i++) {
        cin>>A[i];
    }
    sort(A+1,A+1+n);
    if(n>=4*k) {
        for(long long i=1;i<=2*k;i++) {
            for(long long j=n-2*k+1;j<=n;j++) {
                mp[A[i]+A[j]]++;
            }
        }
        for(long long i=1;i<=2*k;i++) {
            for(long long j=n-2*k+1;j<=n;j++) {
                if(mp[A[i]+A[j]]>=k) st.insert(A[i]+A[j]);
            }
        }
        for(it=st.begin();it!=st.end();it++) {
            if(check(*it)) break;
        }
        sort(v.begin(),v.end());
        for(long long i=0;i<v.size();i++)
        cout<<v[i]<<" ";
    }
    else {
        for(long long i=1;i<=k;i++) {
            for(long long j=n-k+i-1;j<=n;j++) {
                st.insert(A[i]+A[j]);
            }
        }
        for(it=st.begin();it!=st.end();it++) {
            if(check(*it)) break;
        }
        sort(v.begin(),v.end());
        for(long long i=0;i<v.size();i++)
        cout<<v[i]<<" ";
    }
}

Compilation message

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:48:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         for(long long i=0;i<v.size();i++)
      |                           ~^~~~~~~~~
tabletennis.cpp:61:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |         for(long long i=0;i<v.size();i++)
      |                           ~^~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2280 KB Output is correct
2 Correct 317 ms 21868 KB Output is correct
3 Correct 113 ms 13664 KB Output is correct
4 Correct 114 ms 13848 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 18920 KB Output is correct
2 Correct 115 ms 13692 KB Output is correct
3 Correct 336 ms 20460 KB Output is correct
4 Correct 117 ms 13796 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 620 KB Output is correct
2 Correct 201 ms 620 KB Output is correct
3 Correct 1 ms 620 KB Output is correct
4 Correct 53 ms 620 KB Output is correct
5 Correct 1 ms 620 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 384 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 9 ms 620 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 5 ms 620 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 5 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 137 ms 13912 KB Output is correct
3 Correct 320 ms 21868 KB Output is correct
4 Correct 960 ms 21468 KB Output is correct
5 Correct 1199 ms 23188 KB Output is correct
6 Correct 423 ms 13796 KB Output is correct
7 Correct 1050 ms 22288 KB Output is correct
8 Correct 1270 ms 22200 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 4204 KB Output is correct
2 Correct 759 ms 50676 KB Output is correct
3 Correct 716 ms 52828 KB Output is correct
4 Correct 511 ms 47492 KB Output is correct
5 Execution timed out 3060 ms 27880 KB Time limit exceeded
6 Halted 0 ms 0 KB -