oj.uz

Submission #675161

# Submission time Handle Problem Language Result Execution time Memory
675161 2022-12-27T02:17:53 Z Tuanlinh123 Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 198 ms 13800 KB 
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

using namespace std;

#define LOCALIO "C:/Users/admin/Documents/Code/"

ll n, k, a[200005];
map <ll, ll> Map;

void Try(ll sum)
{
    if (Map[sum]==1)
        return;
    Map[sum]=1;
    ll l=1, r=n+k, num=0, cnt=0;
    vector <ll> ans;
    while (ans.size()<n && cnt<=k && r>l)
    {
        while (a[l]+a[r]>sum && r>l)
            r--, cnt++;
        if (a[l]+a[r]==sum) 
            ans.pb(a[l]), ans.pb(a[r]), r--;
        else cnt++;
        l++;
    }
    if (cnt>k || ans.size()<n)
        return;
    sort(ans.begin(), ans.end());
    for (ll i:ans) cout << i << " ";
    exit(0);
}

int main()
{
    #ifdef LOCAL
        freopen( LOCALIO "input.txt","r",stdin) ;
        freopen( LOCALIO "output.txt","w",stdout) ;
    #endif

    ios_base::sync_with_stdio(NULL); cin.tie(nullptr); cout.tie(nullptr);
//	freopen("FIBONACCI.inp","r",stdin);
//	freopen("FIBONACCI.out","w",stdout);
    cin >> n >> k;
    for (ll i=1; i<=n+k; i++)
        cin >> a[i];
    for (ll i=1; i<=k+1; i++)
        for (ll j=n; j<=n+k; j++)
            Try(a[i]+a[j]);
}

Compilation message

tabletennis.cpp: In function 'void Try(long long int)':
tabletennis.cpp:24: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]
   24 |     while (ans.size()<n && cnt<=k && r>l)
      |            ~~~~~~~~~~^~
tabletennis.cpp:33:28: 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]
   33 |     if (cnt>k || ans.size()<n)
      |                  ~~~~~~~~~~^~
tabletennis.cpp:22:20: warning: unused variable 'num' [-Wunused-variable]
   22 |     ll l=1, r=n+k, num=0, cnt=0;
      |                    ^~~

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 7 ms 1084 KB Output is correct
2 Correct 58 ms 4272 KB Output is correct
3 Correct 35 ms 4252 KB Output is correct
4 Correct 35 ms 4296 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 4272 KB Output is correct
2 Correct 51 ms 4288 KB Output is correct
3 Correct 61 ms 4272 KB Output is correct
4 Correct 34 ms 4280 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 6 ms 892 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 596 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 1 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 2 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 51 ms 4288 KB Output is correct
3 Correct 43 ms 4176 KB Output is correct
4 Correct 30 ms 4244 KB Output is correct
5 Correct 33 ms 4256 KB Output is correct
6 Correct 49 ms 4292 KB Output is correct
7 Correct 32 ms 4332 KB Output is correct
8 Correct 36 ms 4248 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 185 ms 13800 KB Output is correct
3 Correct 34 ms 4292 KB Output is correct
4 Correct 119 ms 8880 KB Output is correct
5 Correct 65 ms 4180 KB Output is correct
6 Correct 198 ms 4412 KB Output is correct
7 Correct 87 ms 7200 KB Output is correct
8 Correct 34 ms 4176 KB Output is correct