oj.uz

답안 #845907

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
845907 2023-09-06T19:03:36 Z jamkel19 Table Tennis (info1cup20_tabletennis) C++14
58 / 100
 661 ms 249148 KB 
#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
typedef long long ll;
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n,k;
    cin>>n>>k;
    int N=n+k;
    vector<int>a(N);
    vector<bool>b(2000000001,true);
    for(int i=0;i<N;i++)
    {
        cin>>a[i];
    }
    for(int i=0;i<k+1;i++)
    {
        for(int j=0;j+i<k+1;j++)
        {
            int ile=0,co=a[i]+a[N-j-1];
            if(b[co])
            {
                b[co]=false;
                int start=i,meta=N-j-1;
                vector<int>c(n);
                for(int o=0;i+j+o<=k &&  start<meta;o++)
                {
                    if(a[start]+a[meta]==co)
                    {
                        o--;
                        c[ile]=a[start];
                        c[n-ile-1]=a[meta];
                        ile++;
                        start++;
                        meta--;
                    }
                    else
                    {
                        if(a[start]+a[meta]>co)
                        {
                            meta--;
                        }
                        else
                        {
                            start++;
                        }
                    }
                }
                if(ile>=n/2)
                {
                    for(int w=0;w<n;w++)
                    {
                        cout<<c[w]<<" ";
                    }
                    cout<<endl;
                    return 0;
                }
            }
        }
    }
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 245332 KB Output is correct
2 Correct 27 ms 245064 KB Output is correct
3 Correct 28 ms 245072 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 245512 KB Output is correct
2 Correct 48 ms 249092 KB Output is correct
3 Correct 48 ms 249096 KB Output is correct
4 Correct 48 ms 249020 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 249092 KB Output is correct
2 Correct 48 ms 249036 KB Output is correct
3 Correct 48 ms 249092 KB Output is correct
4 Correct 48 ms 249092 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 244816 KB Output is correct
2 Correct 28 ms 244816 KB Output is correct
3 Correct 29 ms 244820 KB Output is correct
4 Correct 27 ms 245080 KB Output is correct
5 Correct 28 ms 245340 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 244816 KB Output is correct
2 Correct 27 ms 244816 KB Output is correct
3 Correct 26 ms 245072 KB Output is correct

Subtask #6
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 245012 KB Output is correct
2 Correct 27 ms 245080 KB Output is correct
3 Correct 28 ms 245084 KB Output is correct
4 Correct 27 ms 245072 KB Output is correct
5 Correct 26 ms 245072 KB Output is correct
6 Incorrect 28 ms 245072 KB Output not sorted
7 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 244816 KB Output is correct
2 Correct 50 ms 249056 KB Output is correct
3 Correct 48 ms 249092 KB Output is correct
4 Correct 49 ms 248956 KB Output is correct
5 Correct 48 ms 249148 KB Output is correct
6 Incorrect 51 ms 249144 KB Output not sorted
7 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 244820 KB Output is correct
2 Correct 661 ms 248968 KB Output is correct
3 Correct 54 ms 249132 KB Output is correct
4 Correct 502 ms 249092 KB Output is correct
5 Correct 49 ms 249096 KB Output is correct
6 Incorrect 61 ms 249024 KB Output not sorted
7 Halted 0 ms 0 KB -