240112026-02-03 17:05:05BoldizsárLeghosszabb béke (75 pont)cpp17Wrong answer 27/7524ms1612 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	int n,m;cin>> n>>m;
    vector<int>kozott(n);
    int cnt = 0,ans = 0,prev = -1,ossz = 0,start = 1e9,startans = 0;;
    for(int i = 0;i < m;i++){
        int a,b;cin >>a >>b;
        kozott[a-1]++;kozott[b-1]--;
    }
    for(int i =0;i < n-1;i++){
        cnt += kozott[i];
        if(cnt == 0 && prev == cnt){
            ossz++;
            start = min(start,i);
        }
        else{
            prev = cnt;
            if(ans < ossz)
            {ans = ossz;startans = start;}
            ossz = 1;start = 1e9;
        }

    }
    cout << ans-1 <<" "<<  startans+1;
}
SubtaskSumTestVerdictTimeMemory
base27/75
1Accepted0/01ms316 KiB
2Wrong answer0/024ms1588 KiB
3Wrong answer0/31ms508 KiB
4Wrong answer0/31ms316 KiB
5Wrong answer0/31ms316 KiB
6Accepted3/31ms316 KiB
7Wrong answer0/31ms316 KiB
8Wrong answer0/41ms316 KiB
9Wrong answer0/41ms316 KiB
10Wrong answer0/41ms316 KiB
11Wrong answer0/42ms316 KiB
12Wrong answer0/43ms440 KiB
13Wrong answer0/42ms632 KiB
14Wrong answer0/43ms316 KiB
15Wrong answer0/43ms520 KiB
16Accepted4/43ms316 KiB
17Accepted4/43ms564 KiB
18Accepted4/43ms564 KiB
19Wrong answer0/421ms1584 KiB
20Accepted4/421ms608 KiB
21Accepted4/420ms1048 KiB
22Accepted4/423ms1612 KiB