oj.uz

Submission #311169

# Submission time Handle Problem Language Result Execution time Memory
311169 2020-10-09T14:38:08 Z GioChkhaidze Table Tennis (info1cup20_tabletennis) C++14
87 / 100
 3000 ms 42172 KB 
#include <bits/stdc++.h>
 
#define ll long long
#define pb push_back
#define F first
#define S second
 
using namespace std;
 
const int N=2e5+5;

int n,k;
bool f[N];
double a[N];
vector < int > ans;
map < int , int > mp;
unordered_map < int , int > F;

void check(int x) {
  ans.clear();
  int r=n+k;
  
  F.clear();
  for (int i=1; i<=n+k; i++) 
    F[a[i]]++;
  
  for (int i=1; i<=n+k; i++) {
    if (!F[a[i]]) continue;
    --F[a[i]];
    if (!F[x-a[i]]) { F[a[i]]++; continue; }
    --F[x-a[i]];
    ans.pb(a[i]),ans.pb(x-a[i]);
    if (ans.size()==n) break;
  }
  
  if (ans.size()==n) {
    sort(ans.begin(),ans.end());
    for (int i=0; i<ans.size(); i++)
      cout<<ans[i]<<" ";
    exit(0);
  }
}

main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL),cout.tie(NULL);
  
  cin>>n>>k;
  for (int i=1; i<=n+k; i++) 
    cin>>a[i];

  if (n<=4*k) {
    for (int i=1; i<=n+k; i++) 
      for (int j=i+1; j<=n+k; j++) 
        mp[a[i]+a[j]]++;
    for (map < int , int > :: iterator it=mp.begin(); it!=mp.end(); ++it) 
      check((it->first));
    cout<<1/0<<"\n";
    exit(0);
  }

  int R=min(2*k,n+k),L=max(1,n-k+1);
  for (int i=1; i<=R; i++) 
    for (int j=L; j<=n+k; j++) 
      mp[a[i]+a[j]]++;
  
  for (map < int , int > :: iterator it=mp.begin(); it!=mp.end(); ++it) 
    if ((it->second)>=k) check((it->first));
}

Compilation message

tabletennis.cpp: In function 'void check(int)':
tabletennis.cpp:33:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   33 |     if (ans.size()==n) break;
      |         ~~~~~~~~~~^~~
tabletennis.cpp:36:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |   if (ans.size()==n) {
      |       ~~~~~~~~~~^~~
tabletennis.cpp:38:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for (int i=0; i<ans.size(); i++)
      |                   ~^~~~~~~~~~~
tabletennis.cpp:21:7: warning: unused variable 'r' [-Wunused-variable]
   21 |   int r=n+k;
      |       ^
tabletennis.cpp: At global scope:
tabletennis.cpp:44:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   44 | main() {
      |      ^
tabletennis.cpp: In function 'int main()':
tabletennis.cpp:58:12: warning: division by zero [-Wdiv-by-zero]
   58 |     cout<<1/0<<"\n";
      |           ~^~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1792 KB Output is correct
2 Correct 545 ms 18152 KB Output is correct
3 Correct 134 ms 11324 KB Output is correct
4 Correct 131 ms 11292 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 14312 KB Output is correct
2 Correct 131 ms 11324 KB Output is correct
3 Correct 388 ms 17384 KB Output is correct
4 Correct 128 ms 11324 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 768 KB Output is correct
2 Correct 486 ms 1024 KB Output is correct
3 Correct 9 ms 1024 KB Output is correct
4 Correct 219 ms 1116 KB Output is correct
5 Correct 9 ms 1024 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

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

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 138 ms 12860 KB Output is correct
3 Correct 569 ms 19688 KB Output is correct
4 Correct 1228 ms 18560 KB Output is correct
5 Correct 1723 ms 19476 KB Output is correct
6 Correct 157 ms 12864 KB Output is correct
7 Correct 1453 ms 19344 KB Output is correct
8 Correct 1668 ms 19096 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 4728 KB Output is correct
2 Correct 479 ms 40380 KB Output is correct
3 Correct 428 ms 42172 KB Output is correct
4 Correct 325 ms 38368 KB Output is correct
5 Execution timed out 3082 ms 24124 KB Time limit exceeded
6 Halted 0 ms 0 KB -