제출 #1281300

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1281300		tunademayo	Advertisement 2 (JOI23_ho_t2)	C++20	69 / 100	364 ms	25548 KiB

Main

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

#define ll long long

const bool Multitest = 0;

const int N = 5e5 + 10;

struct Data
{
    int a, b;
}; Data a[N];

int n;
map<pair<int, int>, bool> mp;

void pre()
{
    int cnt = 0;

    for(int i = 1 ; i <= n ; i++)
    {
        if(mp.find({a[i].a, a[i].b}) == mp.end())
        {
            cnt++;

            a[cnt] = a[i];
        }
    }

    n = cnt;
}

bool cmp(Data a, Data b)
{
    return a.a < b.a;
}

namespace sub1
{
    bool check()
    {
        for(int i = 1 ; i < n ; i++)
        {
            if(a[i].b != a[i + 1].b) return 0;
        }

        return 1;
    }

    set<int> s;

    void solve()
    {
        for(int i = 1 ; i <= n ; i++)
        {
            s.insert(a[i].a);
        }

        cout << s.size();
    }
}

namespace subf
{
    ll f[N], g[N], t[N];
    ll f2[N];

    void solve()
    {
        sort(a + 1, a + 1 + n, cmp);

        for(int i = 1 ; i <= n ; i++) f[i] = a[i].a - a[i].b, f2[i] = a[i].a + a[i].b;

        g[0] = -2e10 - 10; t[n + 1] = 2e10 + 10;

        //for(int i = 1 ; i <= n ; i++) cout << f[i] << ' '; cout << '\n';

        for(int i = 1 ; i <= n ; i++) g[i] = max(g[i - 1], f2[i]);
        for(int i = n ; i >= 1 ; i--) t[i] = min(t[i + 1], f[i]);

        int cnt = 0;

        for(int i = 1 ; i <= n ; i++)
        {
            if(g[i - 1] >= f2[i] || f[i] >= t[i + 1]) continue;
            cnt++;

            cerr << "answer subf : " << i << '\n';
        }

        cout << cnt;
    }
}

namespace sub2
{
    int deg[N]; const int Sub2 = 1;

    bool check()
    {
        return n <= Sub2;
    }

    void solve()
    {
        sort(a + 1, a + 1 + n, cmp);
        for(int i = 1 ; i <= n ; i++)
        {
            for(int j = 1 ; j <= n ; j++)
            {
                if(i == j) continue;

                if(abs(a[i].a - a[j].a) <= a[i].b - a[j].b)
                {
                    deg[j]++;

                    //cout << i << ' ' << j << '\n';
                }
            }
        }
        int ans = 0;

        for(int i = 1 ; i <= n ; i++)
        {
            if(deg[i] == 0)
            {
                ans++;

                cerr << "answer sub 2 : " << i << '\n';
            }
        }

        cout << ans;
    }
}

void work()
{
    cin >> n;

    for(int i = 1 ; i <= n ; i++) cin >> a[i].a >> a[i].b;

    pre();

    if(sub1::check())
    {
        sub1::solve();

        return;
    }

    if(sub2::check())
    {
        sub2::solve();

        return;
    }

    subf::solve();
}

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

    int q = 1;

    if(fopen("task.inp", "r"))
    {
        freopen("task.inp", "r", stdin);
        freopen("task.out", "w", stdout);
    }

    if(Multitest)   cin >> q;

    while(q--) work();
}

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

Main.cpp: In function 'int main()':
Main.cpp:173:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  173 |         freopen("task.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:174:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  174 |         freopen("task.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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