oj.uz

Submission #728704

# Submission time Handle Problem Language Result Execution time Memory
728704 2023-04-22T21:58:13 Z MilosMilutinovic Table Tennis (info1cup20_tabletennis) C++14
9 / 100
 3000 ms 1544 KB 
#include <bits/stdc++.h>
using namespace std;

int n,k,a[305005],id[305005];

bool solve(int x)
{
    int p=n,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;
}

bool cmp(int i,int j) { return a[i]<a[j]; }

signed main()
{
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n+k;i++) scanf("%d",&a[i]),id[i]=i;
    sort(id+1,id+n+k+1,cmp);
    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,x-k);i<=min(n+k,x+k);i++) if(x!=i&&solve(a[x]+a[i])) exit(0);
        }
    }
}

Compilation message

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

Subtask #1
0 / 11.0

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

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3045 ms 884 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 3058 ms 1544 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 10 ms 212 KB Unexpected end of file - int32 expected
3 Halted 0 ms 0 KB -

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
0 / 14.0

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

Subtask #7
0 / 15.0

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

Subtask #8
0 / 13.0

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