48122023-03-31 12:46:26EyusieLeghosszabb béke (75 pont)cpp14Accepted 75/75197ms4308 KiB
#include <bits/stdc++.h>
#include <iostream>

using namespace std;

#define MAXN 100000

#ifdef M
// no getchar_unlocked on Windows so just call getchar
inline int getchar_unlocked() { return getchar(); }
inline int putchar_unlocked(int c) { return putchar(c); }
#endif

int n, k, m, l, mx, counter, indmx, indcur;
bool x, ag1, ag2, neg_x;
bool a[MAXN + 1];
int i;
int j = 1;

// SORRY EZ CSAK EGY TESZT VOLT TUDJUK A RENDES MEGOLDAST

inline void fastscan(int &number)
{
    //variable to indicate sign of input number
    register int c;

    number = 0;

    // extract current character from buffer
    c = getchar();

    // Keep on extracting characters if they are integers
    // i.e ASCII Value lies from '0'(48) to '9' (57)
    for (; (c>47 && c<58); c=getchar_unlocked())
        number = number *10 + c - 48;
}

int main()
{
    //iostream::sync_with_stdio(0);
    //cin.tie(0);

    //register bool x, ag1, ag2, neg_x;

    fastscan(n);
    fastscan(k);
    for(; i < k; ++i)
    {
        fastscan(m);
        fastscan(l);
        fill(a+m, a+l+1,1);
    }
    for(; j <= n; ++j)
    {
        /*
        if(a[j])
        {
            if(mx < counter)
            {
                indmx = indcur;
                mx = counter;
            }
            counter = 0;
        }
        else
        {
            if(counter == 0)
            {
                indcur = j;
                counter++;
            }
            else counter++;
        }*/

        ag1 = a[j];
        ag2 = !ag1;

        x = ag2*(counter == 0) + ag1*(mx < counter);
        neg_x = !x;
        indmx = ag2*indmx + ag1*(indmx*neg_x + indcur*x);
        mx = ag2*mx + ag1*(mx*neg_x + counter*x);
        indcur = ag2*(indcur*neg_x + j*x) + ag1*indcur;
        counter = ag2*(counter+1);

        //cout << ag1 << " " << ag2 << "\n";
        //cout << x << " " << indmx << " " << mx << " " << indcur << " " << counter << "\n";


    }

    if(mx < counter)
    {
        mx = counter;
        indmx = indcur;
    }

    if(mx == 0)
    {
        putchar_unlocked('-');
        putchar_unlocked('1');
        return 0;
    }

    cout << mx << " " << indmx << "\n";

}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/03ms1888 KiB
2Accepted0/017ms2320 KiB
3Accepted3/33ms2564 KiB
4Accepted3/33ms2520 KiB
5Accepted3/33ms2716 KiB
6Accepted3/33ms2976 KiB
7Accepted3/33ms3236 KiB
8Accepted4/43ms3280 KiB
9Accepted4/43ms3332 KiB
10Accepted4/43ms3616 KiB
11Accepted4/43ms3580 KiB
12Accepted4/43ms3696 KiB
13Accepted4/43ms3696 KiB
14Accepted4/43ms3696 KiB
15Accepted4/43ms3796 KiB
16Accepted4/44ms3804 KiB
17Accepted4/44ms3980 KiB
18Accepted4/49ms4180 KiB
19Accepted4/425ms4308 KiB
20Accepted4/4146ms4120 KiB
21Accepted4/4197ms4136 KiB
22Accepted4/4150ms4148 KiB