제출 #514325

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
514325		Theo830	Table Tennis (info1cup20_tabletennis)	C++17	11 / 100	3056 ms	6688 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n,k;
    cin>>n>>k;
    ll arr[n+k];
    f(i,0,n+k){
        cin>>arr[i];
    }
    vll ans;
    f(i,0,n+k){
        vll a;
        f(j,0,n+k){
            if(j != i){
                a.pb(arr[j]);
            }
        }
        ll sum = 0;
        f(j,0,n){
            if(j % 4 == 1 || j % 4 == 2){
                sum -= a[j];
            }
            else{
                sum += a[j];
            }
        }
        if(sum == 0){
            ans = a;
            break;
        }
    }
    for(auto x:ans){
        cout<<x<<" ";
    }
}

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