Submission #481809

#	Time	Username	Problem	Language	Result	Execution time	Memory
481809		Yazan_Alattar	Football (info1cup20_football)	C++14	0 / 100	2078 ms	1048580 KiB

football

#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <utility>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 200007;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};

int n, k;

int solve(int turn, vector <int> v, int mn)
{
    int cnt = 0;
    for(int i = 0; i < n; ++i) if(v[i]) ++cnt;
    if(!cnt) return (turn % 2) ^ 1;
    int ret = -1;
    for(int i = 0; i < n; ++i){
        for(int j = 1; j <= min(mn, v[i]); ++i){
            v[i] -= j;
            int res = solve(turn + 1, v, j);
            if(ret == -1) ret = res;
            if(turn % 2) ret |= res;
            else ret &= res;
            v[i] += j;
        }
    }
    return ret;
}

int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t;
    cin >> t;
    while(t--){
        cin >> n >> k;
        vector <int> v;
        for(int i = 1; i <= n; ++i){
            int x;
            cin >> x;
            v.pb(x);
        }
        cout << solve(1, v, 3);
    }
    return 0;
}
// Don't forget special cases. (n = 1?)
// Look for the constraints. (Runtime array? overflow?)

• Subtask 1: 0 / 26
• Subtask 2: 0 / 8
• Subtask 3: 0 / 11
• Subtask 4: 0 / 8
• Subtask 5: 0 / 16
• Subtask 6: 0 / 16
• Subtask 7: 0 / 7
• Subtask 8: 0 / 8