256292026-02-23 18:47:36BoldizsárLeghosszabb béke (75 pont)cpp17Wrong answer 72/7565ms1076 KiB
#include <bits/stdc++.h>
using namespace std;
pair<int,int> task (vector<int> t,int s){
    int ch = 0,ck = 0,ah=0,ak=0;
    int cnt = 0;
    for(int i = 1;i <= s;i++){
        cnt += t[i];

        if(cnt == 0){
            if(ch == 0) ck = i;
            ch++;
        }else{
            ch = 0;ck = 0;
        }
        if(ah < ch){
            ah = ch;
            ak = ck;
        }
    }
    pair<int,int>ans{ah,ak};
    return ans;
}
int main() {
	int n,m;cin >> n >> m;
    vector<int>v(n+1);
    for(int i = 0;i < m;i++){
        int a,b;cin >> a >> b;
        v[a]++;
        v[b]--;
    }
    pair<int,int>f =task(v,n);
    if(f.first <= 1) cout << -1;
    else cout << f.first-1 << " " << f.second+1;
    //for(int i =1;i <= n;i++) cerr << v[i] << " ";
}
SubtaskSumTestVerdictTimeMemory
base72/75
1Accepted0/01ms316 KiB
2Accepted0/065ms1076 KiB
3Accepted3/31ms508 KiB
4Wrong answer0/31ms508 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms508 KiB
8Accepted4/41ms500 KiB
9Accepted4/41ms492 KiB
10Accepted4/41ms316 KiB
11Accepted4/44ms316 KiB
12Accepted4/46ms468 KiB
13Accepted4/44ms468 KiB
14Accepted4/44ms316 KiB
15Accepted4/46ms316 KiB
16Accepted4/46ms564 KiB
17Accepted4/46ms576 KiB
18Accepted4/47ms612 KiB
19Accepted4/459ms1056 KiB
20Accepted4/457ms1056 KiB
21Accepted4/456ms1056 KiB
22Accepted4/459ms1056 KiB