제출 #1140425

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1140425		brianhdzmdo	죄수들의 도전 (IOI22_prison)	C++20	0 / 100	0 ms	328 KiB

prison

#include "prison.h"
#include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define allr(a) (a).rbegin(), (a).rend()
#define ll long long
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define fr1(i, a, b) for (ll i = a - 1; i >= b; i--)
#define fi first
#define se second
#define mp(j, k) make_pair(j, k)
#define pb(x) push_back(x)
#define pbp(x, y) push_back({x, y})
#define in(x) insert(x)
#define vec vector<ll>
#define vecv vector<vector<ll>>
#define veb vector<bool>
#define vecp vector<pair<ll,ll>>
#define yes cout << "YES\n";
#define no cout << "NO\n";
#define ac 1e-7
#define fauto(a)   \
  for (auto i : a) \
    cout << i << " ";
#define fautop(a)  \
  for (auto i : a) \
    cout << i.fi << " " << i.se << endl;
using namespace std;

const int ax = 1;

vector<vector<int>> devise_strategy(int N)
{
  vector<vector<int>> ans(N + 1, vector<int>(N + 1));

  fr(i, 0, N + 1)
  {
    fr(j, 1, N + 1)
    {
      if(!i)
      {
        if(j == 0)
        {
          ans[i][j] = 0;
        }
        else if(j == 1)
        {
          ans[i][j] = -1;
        }
        else if(j < N)
        {
          ans[i][j] = j;
        }
        else
          ans[i][j] = -2;
      }
      else if(i == 1)
      {
        if(j == 0)
        {
          ans[i][j] = ax;
        }
        else if(i < j)
        {
          ans[i][j] = -1;
        }
        else if(i > j)
        {
          ans[i][j] = -2;
        }
        else
          ans[i][j] = 0;
          
      }
    }
  }

  return ans;
} 

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