Submission #18576454


Source Code Expand

Copy
#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

bool check(const string& s, int k) {
  int n = SZ(s);
  string t = "110";
  for (int i = 0; i < n; ++i) {
    if (s[i] != t[(i + 3 - k) % 3]) return false;
  }
  return true;
}

int main() {
  int n;
  int64 m = 100000LL * 100000LL;
  string s;
  cin >> n >> s;
  int64 ret = 0;
  if (n == 1) {
    ret = (s == "1" ? 2 * m : m);
  } else if (n == 2) {
    if (s == "10") {
      ret = m;
    } else if (s == "01") {
      ret = m - 1;
    } else if (s == "11") {
      ret = m;
    }
  } else if (n == 3) {
    if (s == "110") {
      ret = m;
    } else if (s == "101" || s == "011") {
      ret = m - 1;
    }
  } else {
    for (int k = 0; k < 3; ++k) {
      if (check(s, k)) {
        if (k == 0) {
          int c = (n + 2) / 3;
          ret = m - c + 1;
        } else {
          int c = (n - k + 2) / 3;
          ret = m - 1 - c + 1;
        }
        break;
      }
    }
  }
  cout << ret << '\n';
  return 0;
}

Submission Info

Submission Time
Task B - Many 110
User cuiaoxiang
Language C++ (Clang 10.0.0)
Score 400
Code Size 3508 Byte
Status AC
Exec Time 14 ms
Memory 3496 KB

Compile Error

./Main.cpp:78:42: warning: unused variable 'inf' [-Wunused-const-variable]
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
                                         ^
./Main.cpp:79:11: warning: unused variable 'MOD' [-Wunused-const-variable]
const int MOD = 1e9 + 7;
          ^
2 warnings generated.

Judge Result

Set Name All Sample
Score / Max Score 400 / 400 0 / 0
Status
AC × 32
AC × 2
Set Name Test Cases
All sample_01.txt, sample_02.txt, testcase_1.txt, testcase_10.txt, testcase_11.txt, testcase_12.txt, testcase_13.txt, testcase_14.txt, testcase_15.txt, testcase_16.txt, testcase_17.txt, testcase_18.txt, testcase_19.txt, testcase_2.txt, testcase_20.txt, testcase_21.txt, testcase_22.txt, testcase_23.txt, testcase_24.txt, testcase_25.txt, testcase_26.txt, testcase_27.txt, testcase_28.txt, testcase_29.txt, testcase_3.txt, testcase_30.txt, testcase_4.txt, testcase_5.txt, testcase_6.txt, testcase_7.txt, testcase_8.txt, testcase_9.txt
Sample sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
sample_01.txt AC 7 ms 3016 KB
sample_02.txt AC 2 ms 3164 KB
testcase_1.txt AC 2 ms 3064 KB
testcase_10.txt AC 2 ms 3096 KB
testcase_11.txt AC 2 ms 3116 KB
testcase_12.txt AC 2 ms 3152 KB
testcase_13.txt AC 1 ms 3152 KB
testcase_14.txt AC 3 ms 3204 KB
testcase_15.txt AC 11 ms 3496 KB
testcase_16.txt AC 14 ms 3308 KB
testcase_17.txt AC 10 ms 3496 KB
testcase_18.txt AC 6 ms 3196 KB
testcase_19.txt AC 4 ms 3236 KB
testcase_2.txt AC 2 ms 3120 KB
testcase_20.txt AC 5 ms 3192 KB
testcase_21.txt AC 8 ms 3284 KB
testcase_22.txt AC 10 ms 3164 KB
testcase_23.txt AC 4 ms 3060 KB
testcase_24.txt AC 9 ms 3332 KB
testcase_25.txt AC 9 ms 3220 KB
testcase_26.txt AC 9 ms 3228 KB
testcase_27.txt AC 9 ms 3176 KB
testcase_28.txt AC 6 ms 3248 KB
testcase_29.txt AC 2 ms 3116 KB
testcase_3.txt AC 2 ms 3176 KB
testcase_30.txt AC 5 ms 3124 KB
testcase_4.txt AC 2 ms 3100 KB
testcase_5.txt AC 2 ms 3240 KB
testcase_6.txt AC 5 ms 3012 KB
testcase_7.txt AC 2 ms 3116 KB
testcase_8.txt AC 2 ms 3164 KB
testcase_9.txt AC 2 ms 3108 KB