Submission #1078770

#TimeUsernameProblemLanguageResultExecution timeMemory
1078770LittleOrangePrisoner Challenge (IOI22_prison)C++17
53 / 100
13 ms1372 KiB
#include "prison.h"

#include <vector>
#include<bits/stdc++.h>
using namespace std;
using ll = int;

std::vector<std::vector<int>> devise_strategy(int N) {
  ll n = N;
  ll lvl = __lg(n)+1;
  ll x = lvl*2+2;
  vector<vector<ll>> ret;
  vector<ll> mp;
  {
    vector<ll> a(n+1,0);
    for(ll i = 1;i<=n;i++) a[i] = (i>>lvl&1)?1:2;
    ret.push_back(a);
  }
  for(ll j = 0;j<=lvl;j++){
    ll h = lvl-j;
    ll tp = j&1^1;
    {
      vector<ll> a(n+1,tp);
      for(ll i = 1;i<=n;i++){
        if (i>>h&1) a[i] = ((i<<1>>h&1)?1:2)+j*2+2;
        else a[i] = -1-tp;
      }
      ret.push_back(a);
    }
    {
      vector<ll> a(n+1,tp);
      for(ll i = 1;i<=n;i++){
        if (i>>h&1^1) a[i] = ((i<<1>>h&1)?1:2)+j*2+2;
        else a[i] = -2+tp;
      }
      ret.push_back(a);
    }
  }
  //ofstream stra("str.txt");
  //stra << ret.size() << "\n";
  x = ret.size()-1;
  for(auto &o : ret){
    for(ll &i : o){
      if (i<-2||i>x) i = x;
    }
   // for(ll i = 0;i<=n;i++) stra << o[i] << " \n"[i==n];
  }
  return ret;
}

Compilation message (stderr)

prison.cpp: In function 'std::vector<std::vector<int> > devise_strategy(int)':
prison.cpp:21:14: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   21 |     ll tp = j&1^1;
      |             ~^~
prison.cpp:33:17: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   33 |         if (i>>h&1^1) a[i] = ((i<<1>>h&1)?1:2)+j*2+2;
      |             ~~~~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...