Submission #845909

# Submission time Handle Problem Language Result Execution time Memory
845909 2023-09-06T19:04:56 Z jamkel19 Table Tennis (info1cup20_tabletennis) C++14
100 / 100
663 ms 249092 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--;
                        if(ile==n/2)
                        {
                            break;
                        }
                    }
                    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;
                }
            }
        }
    }
}
# Verdict Execution time Memory Grader output
1 Correct 27 ms 245084 KB Output is correct
2 Correct 27 ms 244972 KB Output is correct
3 Correct 27 ms 245084 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 29 ms 245328 KB Output is correct
2 Correct 48 ms 247744 KB Output is correct
3 Correct 47 ms 247552 KB Output is correct
4 Correct 46 ms 247620 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 47 ms 247560 KB Output is correct
2 Correct 49 ms 247556 KB Output is correct
3 Correct 47 ms 247556 KB Output is correct
4 Correct 46 ms 247556 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 28 ms 245272 KB Output is correct
2 Correct 28 ms 244816 KB Output is correct
3 Correct 27 ms 244816 KB Output is correct
4 Correct 27 ms 244936 KB Output is correct
5 Correct 27 ms 244816 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 27 ms 245052 KB Output is correct
2 Correct 27 ms 244820 KB Output is correct
3 Correct 27 ms 244820 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 28 ms 244888 KB Output is correct
2 Correct 27 ms 245080 KB Output is correct
3 Correct 27 ms 245004 KB Output is correct
4 Correct 29 ms 245084 KB Output is correct
5 Correct 28 ms 244976 KB Output is correct
6 Correct 27 ms 245076 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 28 ms 245084 KB Output is correct
2 Correct 49 ms 247704 KB Output is correct
3 Correct 48 ms 247560 KB Output is correct
4 Correct 50 ms 247644 KB Output is correct
5 Correct 48 ms 247560 KB Output is correct
6 Correct 49 ms 247624 KB Output is correct
7 Correct 49 ms 248976 KB Output is correct
8 Correct 47 ms 249092 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 28 ms 245048 KB Output is correct
2 Correct 663 ms 247528 KB Output is correct
3 Correct 52 ms 247564 KB Output is correct
4 Correct 505 ms 247520 KB Output is correct
5 Correct 51 ms 247560 KB Output is correct
6 Correct 64 ms 247872 KB Output is correct
7 Correct 288 ms 248976 KB Output is correct
8 Correct 49 ms 249016 KB Output is correct