Submission #751770

#	Time	Username	Problem	Language	Result	Execution time	Memory
751770		AtabayRajabli	Table Tennis (info1cup20_tabletennis)	C++11	20 / 100	3076 ms	6716 KiB

tabletennis

#include <bits/stdc++.h>
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define MAX 5e4 + 1
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define OPT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define sec second
#define fi first
#define elif else if
#define print(k) cerr << "Ans : "; cout << k << endl;
#define int ll
#define ask(a, b) cout << "? " << a << " " << b << endl;
#define ins insert

typedef long long ll;
typedef unsigned long long ull;
const int oo = INT_MAX;
const int ooo = 0x3F3F3F3F3F3F3F3FLL;
const int mod = 301907;
using namespace std;

void solve()
{
    int n, k;
    cin >> n >> k;

    vector<int> v(n+1);

    for(int i = 0; i<n+1; i++)
    {
        cin >> v[i];
    }

    for(int i = 0; i<n+1; i++)
    {
        vector<int> arr;
        for(int j = 0; j<n+1; j++)
        {
            if(i==j)continue;

            arr.pb(v[j]);
        }

        int c = 0;
        for(int i = 0; i<n/2; i++)
        {
            if(arr[i] + arr[n-i-1] != arr[i+1] + arr[n-i-2])
            {
                c = 1;
                break;
            }
        }
        if(c == 0)
        {
            for(int i :  arr)cout << i << " ";
            return;
        }
    }

}

int32_t main()
{
    OPT

    int t = 1;
    //cin >> t;
    while(t--)
        solve();
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 9 / 9
• Subtask 6: 0 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13