제출 #931685

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
931685		Yazan_Alattar	Advertisement 2 (JOI23_ho_t2)	C++14	10 / 100	254 ms	72528 KiB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 1000007;
const ll inf = 1e9;
const ll INF = 1e12;
const ll mod = 1e9 + 7;
const double eps = 1e-6;

pair <ll,ll> a[M];
vector <ll> adj[M];
vector < pair <ll,ll> > order, values;
ll n, ans;
bool visit[M];

void solve(int _){
    cin >> n;
    for(int i = 1; i <= n; ++i){
        cin >> a[i].F >> a[i].S;

        order.pb({a[i].F, i});
        values.pb({a[i].S, i});
    }

    sort(all(order));
    for(int i = 0; i < order.size(); ++i){
        if(i > 0) adj[order[i].S].pb(order[i - 1].S);
        if(i + 1 < order.size()) adj[order[i].S].pb(order[i + 1].S);
    }

    sort(all(values), greater < pair <ll,ll> > ());
    for(auto x : values){
        int i = x.S;
        if(!visit[i]) ++ans;
//        cout << x.F << " " << i << " " << visit[i] << endl;

        for(auto j : adj[i]){
            if(abs(a[i].F - a[j].F) <= a[i].S - a[j].S) visit[j] = 1;
            a[j].S = max(a[j].S, a[i].S - abs(a[i].F - a[i].S));
        }
    }

    cout << ans << endl;
    return;
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t = 1;
//    cin >> t;
    for(int i = 1; i <= t; ++i) solve(t);

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'void solve(int)':
Main.cpp:32:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for(int i = 0; i < order.size(); ++i){
      |                    ~~^~~~~~~~~~~~~~
Main.cpp:34:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         if(i + 1 < order.size()) adj[order[i].S].pb(order[i + 1].S);
      |            ~~~~~~^~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 0 / 23
• Subtask 3: 0 / 36
• Subtask 4: 0 / 31