# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1067876 | 2024-08-21T05:03:10 Z | mindiyak | Preokret (COCI19_preokret) | C++14 | 0 ms | 348 KB |
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops") #include <bits/stdc++.h> #include <string> #include <iostream> #include <cmath> #include <numeric> #include <stack> #include <queue> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<int, int> pi; typedef pair<ll, ll> pl; typedef pair<ld, ld> pd; typedef vector<int> vi; typedef vector<bool> vb; typedef vector<vector<int>> vvi; typedef vector<vector<pi>> vvpi; typedef vector<ld> vd; typedef vector<long long> vl; typedef vector<pi> vpi; typedef vector<pl> vpl; #define FOR(i, a, b) for (ll i = a; i < (b); i++) #define F0R(i, a) for (int i = 0; i < (a); i++) #define FORd(i, a, b) for (int i = (b)-1; i >= a; i--) #define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--) #define trav(a, x) for (auto &a : x) #define uid(a, b) uniform_int_distribution<int>(a, b)(rng) #define len(x) (int)(x).size() #define mp make_pair #define pb push_back #define F first #define nl endl #define S second #define lb lower_bound #define ub upper_bound #define aint(x) x.begin(), x.end() #define raint(x) x.rbegin(), x.rend() #define ins insert const int M = 1e9+7; void init(string name) { freopen((name + ".in").c_str(), "r", stdin); freopen((name + ".out").c_str(), "w", stdout); } void fastIO() { ios_base::sync_with_stdio(0); cin.tie(0); } void solve() { int n;cin >> n; int a[] = {0,0}; int tie=1; int mx = 0,temp = 0,loosing = 0; FOR(i,0,n){ int b;cin >> b;b--; a[b] += 1; if(a[0] == a[1])tie += 1; } cout << a[0] << " " << a[1] << endl; cout << tie << endl; cout << 0 << endl; } int main() { fastIO(); // init("test"); int t = 1; // cin >> t; while (t--) solve(); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 0 ms | 348 KB | Output is partially correct |
2 | Partially correct | 0 ms | 344 KB | Output is partially correct |
3 | Partially correct | 0 ms | 348 KB | Output is partially correct |
4 | Partially correct | 0 ms | 348 KB | Output is partially correct |
5 | Partially correct | 0 ms | 348 KB | Output is partially correct |
6 | Partially correct | 0 ms | 348 KB | Output is partially correct |
7 | Partially correct | 0 ms | 348 KB | Output is partially correct |
8 | Partially correct | 0 ms | 348 KB | Output is partially correct |
9 | Partially correct | 0 ms | 348 KB | Output is partially correct |
10 | Partially correct | 0 ms | 348 KB | Output is partially correct |