oj.uz

답안 #1054138

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1054138 2024-08-12T06:47:39 Z chaoslong Lamps (JOI19_lamps) C++14
0 / 100
 0 ms 348 KB 
// Calm down.
// Think three times, code twice.
#include "bits/stdc++.h"
#define forr(_a,_b,_c) for(int _a = (_b); _a <= (_c); ++_a)
#define ford(_a,_b,_c) for(int _a = (_b) + 1; _a --> (_c);)
#define forf(_a,_b,_c) for(int _a = (_b); _a < (_c); ++_a)
#define st first
#define nd second
#define ll long long
#define ull unsigned long long
#define pii pair <int,int>
#define pll pair <ll,ll>
#define piii pair <int,pii>
#define vi vector <int>
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define mask(i) (1LL << (i))
#define bit(x, i) (((x) >> (i)) & 1)
#define bp __builtin_popcountll
#define file "test"

using namespace std;
const int N = 2e5 + 5;
const int mod = 1e9 + 7; // 998244353
const ll oo = 1e18;

int n;
char a[N];

void to_nho_cau() {
    cin >> n;
    int dem1 = 0, dem0 = 0;
    forr(i, 1, n) cin >> a[i];
    forr(i, 1, n) cin >> a[i];
    a[n+1] = '#';
    forr(i, 1, n) {
        if(a[i] != a[i+1]) {
            if(a[i] == '1') dem1++;
            else dem0++;
        }
    }
    cout << min(dem1, dem0++) << "\n";
}

signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    #ifdef LOCAL
        freopen(file".inp","r",stdin);
        freopen(file".out","w",stdout);
    #endif
    int t = 1;
    //cin >> t;
    while(t--) to_nho_cau();
}
/*
1.self check:
2.long long
3.size of array
4.code for testing
5.initializing
6.modulo number
*/
/**
  ∧__∧
（｀•ω• )づ__∧
（つ　 /( •ω•。)
  しーＪ (nnノ) pat pat
**/
/**  /\_/\
*   (= ._.)
*   / >☕ \>💻
**/
/**
･*･  ∧,,∧ ∧_∧   ･*･
'.　 ( ｡･ω･)(･ω･｡ )　  .'
　'･ |   つ♥と    |.･'
      *'***** '*
**/

Compilation message

lamp.cpp:70:9: warning: "/*" within comment [-Wcomment]
   70 | /**  /\_/\
      |

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -