제출 #1310276

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1310276		the_commando_x	Deda (COCI17_deda)	C++17	140 / 140	328 ms	42684 KiB

deda

// #pragma GCC optimize("O3")
#include <bits/stdc++.h>

using namespace std;

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;

using pii = pair<int, int>;
using vii = vector<pii>;
using vvii = vector<vii>;

using l = long long;
using vl = vector<l>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;

using pll = pair<l, l>;
using vll = vector<pll>;
using vvll = vector<vll>;

using d = double;
using vd = vector<d>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;

using ld = long double;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;

using vb = vector<bool>;
using vvb = vector<vb>;
using pbb = pair<bool, bool>;
using vbb = vector<pbb>;

#define ff first
#define ss second

#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()

void setIO(string name = "")
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if (!name.empty())
    {
        (void)freopen((name + ".in").c_str(), "r", stdin);
        (void)freopen((name + ".out").c_str(), "w", stdout);
    }
}

const ld pi = 3.14159265358979323846;

const l LINF = 1e18;
const l INF = 1e9;

const l MOD = 1e9 + 7;
// const l MOD = 998244353;

const l MAXN = 2e5 + 5;

int n, q;

vi coord;

vector<set<int>> bit(MAXN);

int getX(int x)
{
    return lower_bound(all(coord), x) - coord.begin() + 1;
}

void update(int x, int a)
{
    for (; x <= q; x += x & -x)
        bit[x].insert(a);
}

int queryYB(int y, int b)
{
    int res = INT_MAX;

    for (; y > 0; y -= y & -y)
    {
        auto it = bit[y].lower_bound(b);
        if (it != bit[y].end())
            res = min(res, *it);
    }

    return res == INT_MAX ? -1 : res;
}

void solve()
{
    cin >> n >> q;

    vector<tuple<bool, int, int>> query(q);
    for (int i = 0; i < q; ++i)
    {
        char t;
        int x, a;
        cin >> t >> x >> a;
        query[i] = {t == 'M', x, a};

        coord.push_back(x);
    }

    sort(all(coord));
    coord.erase(unique(all(coord)), coord.end());

    for (auto [t, x, a] : query)
        if (t)
            update(getX(x), a);
        else
            cout << queryYB(getX(x), a) << "\n";
}

int main()
{
    setIO("");

#ifndef ONLINE_JUDGE
    // setIO("filename");
#endif

    int t = 1;
    // cin >> t;
    while (t--)
        solve();

    return 0;
}

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

deda.cpp: In function 'void setIO(std::string)':
deda.cpp:53:22: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |         (void)freopen((name + ".in").c_str(), "r", stdin);
      |               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
deda.cpp:54:22: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |         (void)freopen((name + ".out").c_str(), "w", stdout);
      |               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 140 / 140