oj.uz

답안 #921401

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
921401 2024-02-03T18:59:24 Z maxFedorchuk Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 88 ms 6080 KB 
#include "bits/stdc++.h"
using namespace std;

const long long MX=2e5+10;

long long vis[MX];
long long a[MX];

long long n,k;

bool ok=0;

void solve(long long sum,long long nm)
{
    long long l=1,r=n+k,kpr=0,kg=0;

    while(l<r)
    {
        if((a[l]+a[r])<sum)
        {
            l++;
            kpr++;
        }
        else
        {
            if((a[l]+a[r])==sum)
            {
                vis[l]=vis[r]=nm;
                l++;
                r--;
                kg+=2;
            }
            else
            {
                if((a[l]+a[r])>sum)
                {
                    r--;
                    kpr++;
                }
            }
        }

        if(kpr>k)
        {
            return;
        }

        if(kg==n)
        {
            for(long long i=1;i<=n+k;i++)
            {
                if(vis[i]==nm)
                {
                    cout<<a[i]<<" ";
                }
            }

            ok=1;
            return;
        }
    }
}

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

    cin>>n>>k;

    for(long long i=1;i<=n+k;i++)
    {
        cin>>a[i];
    }

    for(long long i=1,uk=1;(i<=(k+1) && (!ok));i++,uk++)
    {
        for(long long j=max(n,i+1);(j<=n+k && (!ok));j++,uk++)
        {
            solve(a[i]+a[j],uk);
        }
    }

    return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2440 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2652 KB Output is correct
2 Correct 21 ms 6076 KB Output is correct
3 Correct 21 ms 5916 KB Output is correct
4 Correct 21 ms 5980 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 4440 KB Output is correct
2 Correct 21 ms 6016 KB Output is correct
3 Correct 22 ms 5980 KB Output is correct
4 Correct 22 ms 5972 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 2 ms 2392 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2504 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct

Subtask #7
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 22 ms 4700 KB Output is correct
3 Correct 21 ms 5980 KB Output is correct
4 Correct 22 ms 5972 KB Output is correct
5 Correct 21 ms 5968 KB Output is correct
6 Correct 21 ms 5968 KB Output is correct
7 Correct 21 ms 5968 KB Output is correct
8 Correct 21 ms 5980 KB Output is correct

Subtask #8
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 84 ms 4692 KB Output is correct
3 Correct 21 ms 5968 KB Output is correct
4 Correct 51 ms 6080 KB Output is correct
5 Correct 25 ms 5968 KB Output is correct
6 Correct 22 ms 5980 KB Output is correct
7 Correct 88 ms 5968 KB Output is correct
8 Correct 21 ms 5972 KB Output is correct