Submission #643481

#TimeUsernameProblemLanguageResultExecution timeMemory
643481BackNoobAron (COCI17_aron)C++14
50 / 50
1 ms340 KiB
#include <bits/stdc++.h> #define ll long long #define fi first #define se second #define endl '\n' #define MASK(i) (1LL << (i)) #define ull unsigned long long #define ld long double #define pb push_back #define all(x) (x).begin() , (x).end() #define BIT(x , i) ((x >> (i)) & 1) #define TASK "task" #define sz(s) (int) (s).size() using namespace std; const int mxN = 1e6 + 227; const int inf = 1e9 + 277; const int mod = 1e9 + 7; const ll infll = 1e18 + 7; const int base = 307; const int LOG = 20; template <typename T1, typename T2> bool minimize(T1 &a, T2 b) { if (a > b) {a = b; return true;} return false; } template <typename T1, typename T2> bool maximize(T1 &a, T2 b) { if (a < b) {a = b; return true;} return false; } int n; void solve() { cin >> n; char pre = '?'; int res = 0; for(int i = 1; i <= n; i++) { char ch; cin >> ch; if(ch == pre) continue; ++res; pre = ch; } cout << res + 1; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); //freopen("graph.inp", "r", stdin); //freopen("graph.out", "w", stdout); int tc = 1; //cin >> tc; while(tc--) { solve(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...