제출 #1291335

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1291335		discontinuous	Fuel Station (NOI20_fuelstation)	C++20	0 / 100	158 ms	10760 KiB

FuelStation

// Author: Anikait Prasar

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define pb push_back

const ll MOD = 1e9 + 7;
const ll INF = 1e15;
const ll N = 1e6;

ll n, m, k, a, b, c, d, h, l, r, q, x, y;

int rightmostsetbit(ll num) {
    if(num==0) {
        return -1;
    }
    for(int j = 0; j<60; j++) {
        if((1LL << j) & num) {
            return j; 
        }
    }

    return 0; // to avoid warning
}

int leftmostsetbit(ll num) {
    if(num==0) {
        return -1;
    }
    for(int j = 60; j>=0; j--) {
        if((1LL << j) & num) {
            return j; 
        }
    }

    return 0; // to avoid warning
}

vector<int> adj[N+1];
vector<int> visited(N);


void dfs(int node) {
    visited[node] = true;
    for(auto j : adj[node]) {
        if(!visited[j]) dfs(j);
    }
}

vector<int> brr(N);

void solve() {
    cin >> n >> m;
    vector<pair<int, int>> arr(n);
    
    for(int i = 0; i<n; i++) {
        cin >> arr[i].first >> arr[i].second >> x; 
    }

    sort(arr.begin(), arr.end());

    int prev = 0;
    c = 0;

    for(int j = 0; j<n; j++) {
        if(prev < arr[j].first) {
            c += arr[j].first - prev;
        }
        prev = max(prev, arr[j].first + arr[j].second);
    }

    if(prev < n) c += n-prev;

    cout << c;
}

/**
----------------------------------------------------
Problem Notes :-


----------------------------------------------------
**/

int main() {
    ios::sync_with_stdio(false);
    cout.tie(0); cin.tie(0);

    int tc = 1; 
    // cin >> tc;

    while(tc--) {
        solve();
        cout << "\n";
    }

    return 0;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 13
• Subtask 3: 0 / 17
• Subtask 4: 0 / 12
• Subtask 5: 0 / 19
• Subtask 6: 0 / 11
• Subtask 7: 0 / 21