Submission #992044

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
992044	2024-06-03T17:00:24 Z	NoLove	Deda (COCI17_deda)	C++14	140 / 140	329 ms	53768 KB

deda

/**
 *    author : Lăng Trọng Đạt
 *    created: 03-06-2024 
**/
#include <bits/stdc++.h>
using namespace std;
#ifndef LANG_DAT
#define db(...) ;
#endif // LANG_DAT
#define mp make_pair
#define f first
#define s second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define FOR(i, a, b) for (int (i) = (a); (i) <= (b); (i++))
#define si(x) (int)(x.size())
void inline mx(int& a, int b) { if (b > a) a = b; }
void inline mi(int& a, int b) { if (b < a) a = b; }
using pii = pair<int, int>;
const int INF = 1e9;

bool start;
const int MAXN = 4e5 + 5;
int n;
set<int> bit[MAXN];

vector<int> pos;
int id(int p) {
    return upper_bound(all(pos), p) - pos.begin();
}
int32_t main() {
    cin.tie(0)->sync_with_stdio(0);
    if (fopen("hi.inp", "r")) {
        freopen("hi.inp", "r", stdin);
        freopen("./deda/deda.in.7", "r", stdin);
       freopen("hi.out", "w", stdout);
    } 

    int n, m, a, b;
    cin >> n >> m;
    char type;
    map<int, int> vals;
    vector<array<int, 3>> events;
    FOR(i, 1, m) {
        // a is rope, b is age
        cin >> type >> a >> b;
        events.pb({a, b, type == 'D'});
        pos.pb(a);
    }
    sort(all(pos));
    pos.resize(unique(all(pos)) - pos.begin());

    for (auto[a, b, t] : events) {
        if (t) {
            int ans = INF;
            for (int p = id(a); p > 0; p -= p & -p) {
                auto it = bit[p].lower_bound(b);
                if (it != bit[p].end())
                    mi(ans, *it);
            } 
            cout << (ans == INF ? -1 : ans) << "\n";
        } else {
            for (int p = id(a); p <= si(pos); p += p & -p) {
                bit[p].insert(b);
            }
        }
    }
}

Compilation message

deda.cpp: In function 'int32_t main()':
deda.cpp:15:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define FOR(i, a, b) for (int (i) = (a); (i) <= (b); (i++))
      |                               ^
deda.cpp:44:5: note: in expansion of macro 'FOR'
   44 |     FOR(i, 1, m) {
      |     ^~~
deda.cpp:53:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   53 |     for (auto[a, b, t] : events) {
      |              ^
deda.cpp:34:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |         freopen("hi.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
deda.cpp:35:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |         freopen("./deda/deda.in.7", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
deda.cpp:36:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |        freopen("hi.out", "w", stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

140.0 / 140.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	19036 KB	Output is correct
2	Correct	3 ms	19036 KB	Output is correct
3	Correct	5 ms	19560 KB	Output is correct
4	Correct	105 ms	24936 KB	Output is correct
5	Correct	329 ms	53768 KB	Output is correct
6	Correct	271 ms	46332 KB	Output is correct
7	Correct	246 ms	42700 KB	Output is correct