제출 #795252

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
795252		ln_e	죄수들의 도전 (IOI22_prison)	C++17	0 / 100	1 ms	212 KiB

prison

 #include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho
    #include "prison.h"
    using ll=long long;
    using ld=long double;
    int const INF=1000000005;
    ll const LINF=1000000000000000005;
    ll const mod=1000000007;
    ld const PI=3.14159265359;
    ll const MAX_N=3e5+5;
    ld const EPS=0.00000001;
    #pragma GCC optimize("O3")
    #pragma GCC optimize("Ofast")
    #define f first
    #define s second
    #define pb push_back
    #define mp make_pair
    #define endl '\n'
    #define sz(a) (int)a.size()
    #define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    using namespace std;
 mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
std::vector<std::vector<int>> devise_strategy(int N) {
  vector<vector<int>>ans;
for(ll i=0;i<=N;i++){
  vector<int>X;
  ll val=1;
if(i==0){
  X.pb(0);
  val=0;
}else X.pb(1);
  if(i==0){
    for(ll j=1;j<=N;j++)
    {
      X.pb(j);
    }
    ans.pb(X);
    continue;
  }
  for(ll j=1;j<i;j++){
if(val==0){
  X.pb(-1);
  }else {
    X.pb(-2);
  }
}
for(ll j=i;j<=N;j++)
{
  if(i==j){
  X.pb(j);
}else if(val==0){
  X.pb(-2);
  }else {
    X.pb(-1);
  } 
}
ans.pb(X);
}
for(auto it : ans){
  for(auto it1 : it){
    cout<<it1<<' ';
  }
  cout<<endl;
}
return ans;
}

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