48032023-03-31 12:42:22EyusieLeghosszabb béke (75 pont)cpp17Időlimit túllépés 71/75203ms4368 KiB
#include <iostream>

using namespace std;

#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

#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_unlocked();

    // 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";

}
RészfeladatÖsszpontTesztVerdiktIdőMemória
base71/75
1Elfogadva0/03ms1888 KiB
2Elfogadva0/016ms2320 KiB
3Elfogadva3/33ms2408 KiB
4Elfogadva3/33ms2536 KiB
5Elfogadva3/33ms2860 KiB
6Elfogadva3/33ms2860 KiB
7Elfogadva3/33ms3096 KiB
8Elfogadva4/43ms3292 KiB
9Elfogadva4/42ms3372 KiB
10Elfogadva4/42ms3612 KiB
11Elfogadva4/43ms3672 KiB
12Elfogadva4/43ms3572 KiB
13Elfogadva4/43ms3664 KiB
14Elfogadva4/43ms3568 KiB
15Elfogadva4/43ms3800 KiB
16Elfogadva4/44ms3788 KiB
17Elfogadva4/44ms3960 KiB
18Elfogadva4/48ms4160 KiB
19Elfogadva4/423ms4092 KiB
20Elfogadva4/4148ms4368 KiB
21Időlimit túllépés0/4203ms4308 KiB
22Elfogadva4/4145ms4320 KiB