제출 #236055

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
236055		kartel	Aron (COCI17_aron)	C++14	50 / 50	5 ms	384 KiB

aron

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int i, ans, n;
char c, pr;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
////
//    in("input.txt");
//    out("output.txt");

    cin >> n;
    c = 'a';
    for (i = 1; i <= n; i++)
    {
        pr = c;
        cin >> c;
        if (pr != c) ans++;
    }
    cout << ans + 1;
}

//
//110000
//1100

• Subtask 1: 50 / 50