oj.uz

Submission #366033

# Submission time Handle Problem Language Result Execution time Memory
366033 2021-02-12T19:19:51 Z soba Table Tennis (info1cup20_tabletennis) C++14
53 / 100
 3000 ms 97048 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll n , k;
    cin >> n >> k ;
    ll teams=n/2;
    vector<ll>v;
    ll x , y ;
    n+=k;
    map<ll,int>mp;
    for(int i = 0 ; i < n ; i++)
    {
        cin >>  x;
        mp[x]++;
        v.push_back(x);
    }
    sort(v.begin(), v.end());
    vector<ll>poten;
    for(int i = 0 ; i< k+1 ; i++)
    {
        for( int j = n-1; j >= n-(k+1) ; j-- )
        {
            poten.push_back(v[i]+v[j]);
        }
    }
    int sz=poten.size();
    vector<ll>ansa;
    ll cnt;
    for( int i = 0 ; i  < sz ; i++)
    {
        ansa.clear();
        ll tmp=teams;
        cnt=0;
        for(int j = 0 ; v[j]<(poten[i]/2) ; j++ )
        {
            if(poten[i]-v[j]==v[j])continue;
            if(mp[poten[i]-v[j]])
            {
                tmp--;
                ansa.push_back(poten[i]-v[j]);
                ansa.push_back(v[j]);
            }
            else cnt++;
            if(tmp==0)
                break;
            if(cnt==k)
                break;
        }
        if(tmp==0)
        {
            break;
        }
    }
//    cout << ansa[0] << "\n";
//    cout << ansa.size() << "\n";
    sort( ansa.begin() , ansa.end());
    for(int i = 0 ; i < teams*2 ; i++)
    {
        cout << ansa[i] <<  " " ;
    }
    return 0;
}

Compilation message

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:14:12: warning: unused variable 'y' [-Wunused-variable]
   14 |     ll x , y ;
      |            ^

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 492 KB Output not sorted
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 2280 KB Output not sorted
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 15068 KB Output is correct
2 Correct 89 ms 15344 KB Output is correct
3 Incorrect 73 ms 13148 KB Output not sorted
4 Halted 0 ms 0 KB -

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 876 KB Output is correct
2 Correct 403 ms 29304 KB Output is correct
3 Correct 3 ms 1132 KB Output is correct
4 Correct 107 ms 21124 KB Output is correct
5 Correct 2 ms 1004 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 3 ms 888 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 2 ms 748 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 2 ms 620 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 98 ms 15068 KB Output is correct
3 Correct 90 ms 15452 KB Output is correct
4 Correct 100 ms 15580 KB Output is correct
5 Correct 94 ms 15584 KB Output is correct
6 Correct 90 ms 15452 KB Output is correct
7 Correct 93 ms 15580 KB Output is correct
8 Correct 89 ms 15452 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 4960 KB Output is correct
2 Execution timed out 3064 ms 97048 KB Time limit exceeded
3 Halted 0 ms 0 KB -