Submission #1072637

#	Time	Username	Problem	Language	Result	Execution time	Memory
1072637		vjudge1	Prisoner Challenge (IOI22_prison)	C++17	0 / 100	0 ms	348 KiB

prison

#include <bits/stdc++.h>
#include "prison.h"
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx2")
// #pragma GCC target("popcnt")
using namespace std;
 
using ll = long long;
using ull = unsigned long long;
using lld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int,int>;
using pll = pair<ll, ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
 
#define endl '\n'
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
 
#define fore(i,l,r) for(auto i=l;i<r;i++)
#define fo(i,n) fore(i,0,n)
#define forex(i,r,l) for(auto i=r; i>=l;i--)
#define ffo(i,n) forex(i,n-1,0)

bool cmin(int &a, int b){if(b<a){a=b;return 1;}return 0;}
bool cmax(int &a, int b){if(b>a){a=b;return 1;}return 0;}
void valid(ll in){cout<<((in)?"YES\n":"NO\n");}
ll lcm(ll a, ll b){return (a/gcd(a,b))*b;}
ll gauss(ll n){return (n*(n+1))/2;}

vector<vi> devise_strategy(int n) {
    vector<vi> ans;
    vi s;
    s.pb(-1);
    fore(j, 1, n+1) {
        s.pb(j);
    }
    ans.pb(s);
    fore(i, 1, n+1) {
        s.pb(-2);
        fore(j, 1, n+1) {
            s.pb((i==j?0:(i<j?-1:-2)));
        }
        ans.pb(s);
    }
    return ans;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 90