oj.uz

Submission #728707

# Submission time Handle Problem Language Result Execution time Memory
728707 2023-04-22T22:01:58 Z MilosMilutinovic Table Tennis (info1cup20_tabletennis) C++14
100 / 100
 1126 ms 5600 KB 
#include <bits/stdc++.h>
using namespace std;

int n,k,a[305005];

bool solve(int x)
{
    int p=n+k,c=0;
    vector<int> ans;
    for(int i=1;i<=n+k;i++)
    {
        while(p>i&&a[i]+a[p]>x) p--;
        if(p>i&&a[i]+a[p]==x)
        {
            ans.push_back(a[i]);
            ans.push_back(a[p]);
            c++,p--;
        }
    }
    if(c>=n/2)
    {
        sort(ans.begin(),ans.end());
        for(int i=0;i<(int)ans.size();i++) printf("%d ",ans[i]);
        return true;
    }
    return false;
}

signed main()
{
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n+k;i++) scanf("%d",&a[i]);
    sort(a+1,a+n+k+1);
    if(n<=k)
    {
        for(int i=1;i<=n+k;i++) for(int j=i+1;j<=n+k;j++) if(solve(a[i]+a[j])) exit(0);
    }
    else
    {
        mt19937 rng(time(0));
        while(true)
        {
            int x=rng()%(n+k)+1;
            for(int i=max(1,(n+k-x)-3*(k+1));i<=min(n+k,(n+k-x)+3*(k+1));i++) if(x!=i&&solve(a[x]+a[i])) exit(0);
        }
    }
}

Compilation message

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:31:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |     scanf("%d%d",&n,&k);
      |     ~~~~~^~~~~~~~~~~~~~
tabletennis.cpp:32:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |     for(int i=1;i<=n+k;i++) scanf("%d",&a[i]);
      |                             ~~~~~^~~~~~~~~~~~

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 728 KB Output is correct
2 Correct 41 ms 2996 KB Output is correct
3 Correct 43 ms 4544 KB Output is correct
4 Correct 43 ms 4412 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 3024 KB Output is correct
2 Correct 39 ms 4476 KB Output is correct
3 Correct 38 ms 4560 KB Output is correct
4 Correct 41 ms 4488 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 7 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 212 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 0 ms 212 KB Output is correct
2 Correct 0 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 89 ms 3052 KB Output is correct
3 Correct 48 ms 4440 KB Output is correct
4 Correct 52 ms 4452 KB Output is correct
5 Correct 55 ms 4436 KB Output is correct
6 Correct 75 ms 5440 KB Output is correct
7 Correct 57 ms 4428 KB Output is correct
8 Correct 52 ms 4456 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 1126 ms 3040 KB Output is correct
3 Correct 611 ms 4464 KB Output is correct
4 Correct 401 ms 4496 KB Output is correct
5 Correct 301 ms 4396 KB Output is correct
6 Correct 662 ms 5600 KB Output is correct
7 Correct 432 ms 4544 KB Output is correct
8 Correct 408 ms 4480 KB Output is correct