oj.uz

Submission #845005

# Submission time Handle Problem Language Result Execution time Memory
845005 2023-09-06T10:50:11 Z jamkel19 Table Tennis (info1cup20_tabletennis) C++14
87 / 100
 3000 ms 4612 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);
    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=1,co=a[i]+a[N-j-1];
            vector<int>b(n);
            b[0]=a[i];
            b[n-1]=a[N-j-1];
            for(int o=i+1;o<N-j-2;o++)
            {
                int start=o+1,meta=N-j-2,s=(start+meta)/2;
                    while(start<meta)
                    {
                        if(a[s]+a[o]==co)
                        {
                            break;
                        }
                        if(a[s]+a[o]>co)
                        {
                            meta=s;
                        }
                        if(a[s]+a[o]<co)
                        {
                            start=s+1;
                        }
                        s=(start+meta)/2;
                    }
                    if(a[s]+a[o]==co)
                    {
                        b[ile]=a[o];
                        b[n-1-ile]=a[s];
                        ile++;
                    }
                    if(ile==n/2)
                    {
                        break;
                    }
            }
            if(ile==n/2)
            {
                for(int w=0;w<n;w++)
                {
                    cout<<b[w]<<" ";
                }
                cout<<endl;
                return 0;
            }
        }
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 600 KB Output is correct
2 Correct 34 ms 3076 KB Output is correct
3 Correct 27 ms 4360 KB Output is correct
4 Correct 27 ms 4356 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 3024 KB Output is correct
2 Correct 34 ms 4512 KB Output is correct
3 Correct 48 ms 4612 KB Output is correct
4 Correct 32 ms 4304 KB Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 9 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1072 ms 2892 KB Output is correct
3 Correct 95 ms 4416 KB Output is correct
4 Correct 691 ms 4336 KB Output is correct
5 Correct 58 ms 4540 KB Output is correct
6 Correct 219 ms 4372 KB Output is correct
7 Correct 682 ms 4348 KB Output is correct
8 Correct 54 ms 4352 KB Output is correct

Subtask #8
0 / 13.0

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