oj.uz

Submission #718169

# Submission time Handle Problem Language Result Execution time Memory
718169 2023-04-03T14:15:35 Z vjudge1 Table Tennis (info1cup20_tabletennis) C++17
49 / 100
 3000 ms 374120 KB 
#include "bits/stdc++.h"
#define ll long long
#define pb push_back
#define endl '\n'
#define fi first
#define sec second
using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    ll n,k;
    cin>>n>>k;
    map<ll,vector<ll>>mp;
    ll arr[n+k];
    ll cnt;
    for(int i=0;i<n+k;i++)
    {
      cin>>arr[i];
      if(i)
        for(int j=0;j<i;j++)
        {
          mp[arr[i]+arr[j]].pb(arr[i]);
          mp[arr[i]+arr[j]].pb(arr[j]);
          if(mp[arr[i]+arr[j]].size()==n)cnt=arr[i]+arr[j];
        }
    }
    vector<ll>ans;
    for(auto u:mp[cnt])ans.pb(u);
    sort(ans.begin(),ans.end());
    for(auto u:ans)cout<<u<<' ';
    return 0;
}
/*

*/

Compilation message

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:28:38: 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]
   28 |           if(mp[arr[i]+arr[j]].size()==n)cnt=arr[i]+arr[j];
      |              ~~~~~~~~~~~~~~~~~~~~~~~~^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1039 ms 133168 KB Output is correct
2 Correct 267 ms 42504 KB Output is correct
3 Correct 1415 ms 167592 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3069 ms 331324 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3089 ms 374120 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1236 KB Output is correct
2 Correct 8 ms 2004 KB Output is correct
3 Correct 7 ms 1984 KB Output is correct
4 Correct 7 ms 2092 KB Output is correct
5 Correct 7 ms 1984 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 1 ms 212 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 380 ms 46752 KB Output is correct
3 Correct 2141 ms 207264 KB Output is correct
4 Correct 1564 ms 172048 KB Output is correct
5 Correct 288 ms 46788 KB Output is correct
6 Correct 305 ms 42716 KB Output is correct

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Execution timed out 3076 ms 298176 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 10356 KB Output is correct
2 Execution timed out 3080 ms 341036 KB Time limit exceeded
3 Halted 0 ms 0 KB -