제출 #1151873

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1151873		aagii	Infinite Race (EGOI24_infiniterace2)	C++20	0 / 100	71 ms	117436 KiB

Main

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define sz size()
#define veg vegeta
#define harderahhh ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
const int N = 1e9+7;
using namespace std;
ll x, l, y, t, z, hp, sus1, sus2, g, sus, sus3, bruh, bruh1, bruh2, bruh3, dog1, h, r, dog2, dog3;
ll ck1, ck2, ck3, dog, i, p, j, q, m, a[1000005], b[696969], c[696969], n, k, d[696969], e[696969];
ll x2[696969], x17[696969], x1[696969], joy[1005][1005], pp[2005][2005], di[1234566], de[1234566];
string s1, s2, s3, s4, s5, s6, s7, s8, s9, rep1, rep2, rep, s, hsr[696969], gi[696969];
char c1, c2, oon, hi[1005][1005], na[1005][1005], cc[696969];
pair <ll, ll> goku[696969], veg[696969];
vector <ll> aag[500005], eeg[200005], ski, bidi;
bool vis[200005];
map <pair<ll,ll>, ll> mm;
map <ll, ll> wii;
set <ll> baka[1000005], kk;
void dfs(ll x) {
    
}
int main() { 
    harderahhh;
    cin >> n >> k;
    for (i = 1; i <= k; i++) {
        cin >> a[i];
        aag[abs(a[i])].pb(a[i]);
    }
    for (i = 1; i < n; i++) {
        x=1;
        y=0;
        for (j = 0; j < aag[i].sz; j++) {
            if (x > y) {
                y = x;
            }
            if (aag[i][j] == aag[i][j+1]) {
                x++;
            } else {
                x=0;
            }
        }
        ski.pb(y);
    }
    sort (ski.begin(), ski.end());
    for (i = 0; i < ski.sz; i++) {
        if (ski[i] == ski[ski.sz-1]) x++;
    }
    if (x == n-1 && n != 2) {
        cout << ski[ski.sz-1];
    } else {
        cout << ski[ski.sz-1]-1;
    }
    
}

• Subtask 1: 0 / 29
• Subtask 2: 0 / 34
• Subtask 3: 0 / 22
• Subtask 4: 0 / 15