제출 #1137311

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1137311		huutuan	Broken Device 2 (JOI22_device2)	C++20	20 / 100	481 ms	23860 KiB

Anna

#include "Anna.h"
#include <utility>
#include <vector>

#include <bits/stdc++.h>

using namespace std;

namespace Anna_solver{
   const int M=2000;
   int Declare(){
      return M;
   }
   pair<vector<int>, vector<int>> Anna(unsigned long long A){
      vector<int> v;
      vector<int> vv;
      for (int i=0; i<64; ++i){
         if (A>>i&1) vv.push_back(0);
         vv.push_back(1);
      }
      v.push_back(1);
      while ((int)v.size()+(int)vv.size()<=M) v.insert(v.end(), vv.begin(), vv.end());
      return {vector<int>(v.size(), 0), v};
   }
}

int Declare() {
   return Anna_solver::Declare();
}

std::pair<std::vector<int>, std::vector<int> > Anna(long long A) {
   return Anna_solver::Anna(A);
}

Bruno

#include "Bruno.h"
#include <utility>
#include <vector>

#include <bits/stdc++.h>

using namespace std;

namespace Bruno_solver{
   const int M=2000;
   long long Bruno(vector<int> v){
      unsigned long long ans=0;
      vector<int> mn(64, 100), id;
      for (int i=0; i<(int)v.size(); ++i){
         if (v[i]==1) id.push_back(i);
      }
      for (int i=0; i<(int)id.size()-1; ++i){
         mn[i%64]=min(mn[i%64], id[i+1]-id[i]-1);
      }
      for (int i=0; i<64; ++i){
         if (mn[i]) ans|=1ull<<i;
      }
      return ans;
   }
}

long long Bruno(std::vector<int> u) {
   return Bruno_solver::Bruno(u);
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 3
• Subtask 4: 0 / 12
• Subtask 5: 0 / 15
• Subtask 6: 15 / 60