131282025-01-06 17:32:18ubormaciÁruszállítás üres szakaszaicpp17Elfogadva 50/5052ms4672 KiB
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint>
#include <queue>
#include <stack>
#include <deque>
#include <numeric>
#include <fstream>
using namespace std;

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*

notes:

int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string

vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));

{if statement} ? {truth value} : {false value}

set lower bound/upper bound:
 	// . . . m1 . . . d . . . . m2
    auto m1_it = b.lower_bound(d);
    advance(m1_it, -1);
    m1 = *m1_it;
	m2 = *b.upper_bound(d);

#ifdef LOCAL
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif

constexpr auto lcm(auto x, auto... xs)
{
	return ((x = std::lcm(x, xs)), ...);
}

std::gcd(int a, int b)

*/

typedef long long ll;

void solve() {
    ll n, m;
    cin >> n >> m;
    vector<pair<ll,ll>> q;

    ll s = 0;
    ll in = 0;

    for(ll i = 0; i < m; i++) {
        ll a, b;
        cin >> a >> b;
        q.push_back({a, -1});
        q.push_back({b, 1});
    }

    sort(q.begin(), q.end());
    if(q[0].first != 1) {
        s++;
    }
    for(ll i = 0; i < q.size(); i++) {
        ll loc = q[i].first;
        in -= q[i].second;
        if(in == 0 && loc != n) {
            s++;
        }
    }

    cout << s;

}

int main()
{
	std::ios_base::sync_with_stdio(false);

	solve();

	return 0;
}
RészfeladatÖsszpontTesztVerdiktIdőMemória
base50/50
1Elfogadva0/01ms512 KiB
2Elfogadva0/052ms4560 KiB
3Elfogadva2/21ms316 KiB
4Elfogadva2/21ms316 KiB
5Elfogadva2/21ms316 KiB
6Elfogadva2/21ms316 KiB
7Elfogadva2/21ms316 KiB
8Elfogadva2/21ms316 KiB
9Elfogadva2/21ms316 KiB
10Elfogadva2/21ms508 KiB
11Elfogadva2/21ms316 KiB
12Elfogadva2/21ms316 KiB
13Elfogadva3/34ms820 KiB
14Elfogadva3/34ms696 KiB
15Elfogadva3/33ms632 KiB
16Elfogadva3/334ms4616 KiB
17Elfogadva3/335ms4524 KiB
18Elfogadva3/341ms4672 KiB
19Elfogadva3/34ms868 KiB
20Elfogadva3/34ms948 KiB
21Elfogadva3/346ms4444 KiB
22Elfogadva3/348ms4552 KiB