oj.uz

답안 #1068207

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1068207 2024-08-21T08:31:58 Z mindiyak Preokret (COCI19_preokret) C++14
44 / 50
 1 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;
    vi a = {0,0};
    int tie=1;
    int mx = 0;
    vi arr(n);

    FOR(i,0,n){
        int b;cin >> b;b--;
        a[b] += 1;
        if(a[0] == a[1])tie += 1;
        arr[i] = b;       
    }

    a = vi(2,0);
    FOR(i,0,n){
        if(a[0] > a[1]){
            int j = 0,k = i;
            while(k < n && arr[k] == 1){j++;k++;}
            // cerr << "0 " << a[0] << ":" << a[1] << " " << i << " " << j << endl;
            mx = max(mx,j);
        }
        else if(a[1] > a[0]){
            int j = 0,k = i;
            while(k < n && arr[k] == 0){k++;j++;}
            // cerr << "1 " << a[0] << ":" << a[1] << " " << i << " " << j << endl;
            mx = max(mx,j);
        }
        a[arr[i]] += 1;
    }

    cout << a[0] << " " << a[1] << endl;
    cout << tie << endl;
    cout << mx << endl;
}   
 
 
int main()
{
    fastIO();
    // init("test");
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}

Compilation message

preokret.cpp: In function 'void init(std::string)':
preokret.cpp:44:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     freopen((name + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
preokret.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     freopen((name + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
44.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Partially correct 0 ms 348 KB Output is partially correct
8 Correct 0 ms 348 KB Output is correct
9 Partially correct 0 ms 348 KB Output is partially correct
10 Correct 1 ms 348 KB Output is correct