oj.uz

Submission #910958

# Submission time Handle Problem Language Result Execution time Memory
910958 2024-01-18T10:16:23 Z vjudge1 Table Tennis (info1cup20_tabletennis) C++17
20 / 100
 66 ms 4440 KB 
#include <iostream>

using namespace std;

#define MAXN 150000
#define MAXK 400

int v[MAXN+MAXK+1];
int sol[MAXN+1];

int main()
{
    int n, k;
    cin>>n>>k;
    int i;
    long long sum;
    sum=0;
    for(i=1; i<=n+k; i++)
    {
        cin>>v[i];
        sum+=v[i];
    }
    if(k==1)
    {
        int p, csum, ok, j;
        for(i=1; i<=n+k; i++)
        {
            if((sum-v[i])%(n/2)==0)
            {
                p=1;
                for(j=1; j<=n+k; j++)
                    if(j!=i)
                        sol[p++]=v[j];
                p=n;
                csum=(sum-v[i])/(n/2);
                ok=0;
                for(j=1; j<=n/2; j++)
                {
                    if(sol[j]+sol[p]==csum)
                        ok++;
                    p--;
                }
                if(ok==n/2)
                    break;
            }
        }
    }
    for(i=1; i<=n; i++)
        cout<<sol[i]<<" ";
}

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 604 KB Output is correct
2 Correct 59 ms 3028 KB Output is correct
3 Correct 55 ms 4440 KB Output is correct
4 Correct 66 ms 4416 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 50 ms 1108 KB Output not subsequence of input
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output not subsequence of input
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output not subsequence of input
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output not subsequence of input
2 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output not subsequence of input
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output not subsequence of input
2 Halted 0 ms 0 KB -