Submission #43621159


Source Code Expand

Copy
#include <bits/stdc++.h>
#define INF (__LONG_LONG_MAX__ / 3)
using ll = long long;
using namespace std;
ll n;
string s;
vector<vector<ll>> dp;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> s;
dp.resize(2, vector<ll>(s.size(), 0));
for(ll i = 0; i < n; i++) {
if(s[i] == '0') {
dp[0][i] += 1;
if(i > 0) {
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include <bits/stdc++.h>
#define INF (__LONG_LONG_MAX__ / 3)
using ll = long long;
using namespace std;

ll n;
string s;
vector<vector<ll>> dp;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  
  cin >> n >> s;
  dp.resize(2, vector<ll>(s.size(), 0));


  for(ll i = 0; i < n; i++) {
    if(s[i] == '0') {
      dp[0][i] += 1;
      if(i > 0) {
        dp[1][i] += dp[0][i - 1];
        dp[1][i] += dp[1][i - 1];
      }
    } else {
      dp[1][i] += 1;
      if(i > 0) {
        dp[0][i] += dp[1][i - 1];
        dp[1][i] += dp[0][i - 1];
      }
    }
  }

  ll answer = 0;
  for(ll i = 0; i < n; i++) {
    answer += dp[1][i];
  }

  cout << answer << '\n';
  
  return 0;
}

Submission Info

Submission Time
Task E - NAND repeatedly
User jbhus
Language C++ (GCC 9.2.1)
Score 450
Code Size 736 Byte
Status AC
Exec Time 39 ms
Memory 27684 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 450 / 450
Status
AC × 2
AC × 32
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt
All 00_sample_00.txt, 00_sample_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 02_handmade_12.txt, 02_handmade_13.txt, 02_handmade_14.txt, 02_handmade_15.txt, 02_handmade_16.txt, 02_handmade_17.txt, 02_handmade_18.txt, 02_handmade_19.txt, 02_handmade_20.txt, 02_handmade_21.txt, 02_handmade_22.txt, 02_handmade_23.txt, 02_handmade_24.txt, 02_handmade_25.txt, 02_handmade_26.txt, 02_handmade_27.txt, 02_handmade_28.txt, 02_handmade_29.txt, 02_handmade_30.txt, 02_handmade_31.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 11 ms 3520 KB
00_sample_01.txt AC 2 ms 3520 KB
01_random_02.txt AC 34 ms 27592 KB
01_random_03.txt AC 33 ms 27680 KB
01_random_04.txt AC 30 ms 27604 KB
01_random_05.txt AC 39 ms 27672 KB
01_random_06.txt AC 36 ms 27612 KB
01_random_07.txt AC 26 ms 24180 KB
01_random_08.txt AC 22 ms 21096 KB
01_random_09.txt AC 29 ms 20480 KB
01_random_10.txt AC 23 ms 19420 KB
01_random_11.txt AC 13 ms 9032 KB
02_handmade_12.txt AC 21 ms 19944 KB
02_handmade_13.txt AC 24 ms 19956 KB
02_handmade_14.txt AC 29 ms 27612 KB
02_handmade_15.txt AC 32 ms 27676 KB
02_handmade_16.txt AC 29 ms 27684 KB
02_handmade_17.txt AC 33 ms 27672 KB
02_handmade_18.txt AC 2 ms 3528 KB
02_handmade_19.txt AC 3 ms 3532 KB
02_handmade_20.txt AC 2 ms 3512 KB
02_handmade_21.txt AC 2 ms 3472 KB
02_handmade_22.txt AC 3 ms 3528 KB
02_handmade_23.txt AC 2 ms 3456 KB
02_handmade_24.txt AC 2 ms 3528 KB
02_handmade_25.txt AC 2 ms 3540 KB
02_handmade_26.txt AC 2 ms 3532 KB
02_handmade_27.txt AC 2 ms 3540 KB
02_handmade_28.txt AC 3 ms 3440 KB
02_handmade_29.txt AC 2 ms 3404 KB
02_handmade_30.txt AC 3 ms 3456 KB
02_handmade_31.txt AC 3 ms 3536 KB


2025-03-05 (Wed)
18:06:08 +00:00