oj.uz

Submission #936043

# Submission time Handle Problem Language Result Execution time Memory
936043 2024-03-01T03:53:58 Z Populus_euphratica Table Tennis (info1cup20_tabletennis) C++14
35 / 100
 79 ms 9220 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

template<typename T> inline void read(T &x)
{
    x = 0;
    T f = 1;char ch = getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')
        {
            f = -1,ch = getchar();
            break;
        }
        ch = getchar();
    }
    while(ch>='0'&&ch<='9')
        x = (x<<3)+(x<<1)+ch-48,ch = getchar();
    x*=f;
}
template<typename T = int> inline T read()
{
    T x;read(x);return x;
}
template<typename T> void write(T x)
{
    if(x<0) x = -x,putchar('-');
    if(x>9) write(x/10);
    putchar(x%10+48);
}
template<typename T> inline void writen(T x)
{
    write(x);
    putchar(10);
}
const int N = 2e5+5;
unordered_map<int,int> mp;
int n,k,a[N];
bool vis[N];
void solve(int sum)
{
    int l = 1,r = n+k,kpr = 0,kg = 0;
    for(int i = 1;i<=n+k;i++)
        vis[i] = 0;
    while(l<r)
    {
        if((a[l]+a[r])<sum) l++,kpr++;
        else
        {
            if((a[l]+a[r])==sum) vis[l] = vis[r] = 1,l++,r--,kg+=2;
            else if((a[l]+a[r])>sum) r--,kpr++;
        }
        if(kpr>k) return;
        if(kg==n)
        {
            for(int i = 1;i<=n+k;i++)
                if(vis[i]) cout<<a[i]<<" ";
            exit(0);
        }
    }
}
signed main()
{
//    freopen(".in","r",stdin);
//    freopen(".out","w",stdout);
    read(n),read(k);
    for(int i = 1;i<=n+k;i++)
        read(a[i]);
    for(int i = 1;i<=k+1;i++)
        for(int j = max(n,i+1);j<=n+k;j++)
            mp[a[i]+a[j]]++;
    if((n+k)<=4*k) for(auto i:mp) solve(i.first);
    else for(auto i:mp) if(i.second>=k) solve(i.first);
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 460 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 860 KB Output is correct
2 Correct 16 ms 4624 KB Output is correct
3 Correct 16 ms 4432 KB Output is correct
4 Correct 15 ms 4432 KB Output is correct

Subtask #3
0 / 14.0

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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

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

Subtask #7
0 / 15.0

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

Subtask #8
0 / 13.0

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