Submission #760440

#	Time	Username	Problem	Language	Result	Execution time	Memory
760440		GrindMachine	Tram (CEOI13_tram)	C++17	65 / 100	1076 ms	1516 KiB

tram

// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

ll sq(ll x){
    if(x > inf1) return x;
    return x * x;
}

void solve(int test_case)
{
    ll n,m; cin >> n >> m;
    vector<pll> sit(m+5);
    bool here[n+5][2];
    memset(here,0,sizeof here);
    multiset<ll> ms;
    ll active = 0;

    rep1(id,m){
        char t; cin >> t;
        if(t == 'E'){
            active++;
            if(active == 1){
                cout << "1 1" << endl;
                ms.insert(1);
                here[1][1] = 1;
                sit[id] = {1,1};
                conts;
            }

            vector<ll> v(all(ms));
            vector<ll> cand;
            cand.pb(1);
            cand.pb(n);

            rep(i,sz(v)-1){
                ll x = (v[i] + v[i+1]) / 2;
                ll y = ceil2(v[i] + v[i+1], 2);
                cand.pb(x);
                cand.pb(y);
            }

            sort(all(cand));
            cand.resize(unique(all(cand)) - cand.begin());

            ll mx = -1;
            pll px = {-1,-1};

            trav(i,cand){
                rep1(j,2){
                    auto it = ms.lower_bound(i);
                    ll mn = inf2;

                    if(it != ms.end()){
                        ll r = *it;
                        rep1(j2,2){
                            if(here[r][j2]){
                                ll cost = sq(i-r) + (j != j2);
                                amin(mn, cost);
                            }
                        }
                    }

                    if(it != ms.begin()){
                        it--;
                        ll r = *it;
                        rep1(j2,2){
                            if(here[r][j2]){
                                ll cost = sq(i-r) + (j != j2);
                                amin(mn, cost);
                            }
                        }
                    }
                    
                    // cout << i << " " << j << endl;
                    // debug(mn);

                    if(mn > mx){
                        mx = mn;
                        px = {i,j};
                    }
                }
            }

            cout << px.ff << " " << px.ss << endl;
            // cout << endl;

            sit[id] = px;
            ms.insert(px.ff);
            here[px.ff][px.ss] = 1;
        }
        else{
            ll k; cin >> k;
            auto [i,j] = sit[k];
            ms.erase(ms.find(i));
            here[i][j] = 0;
            active--;
        }
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message (stderr)

tram.cpp: In function 'void solve(int)':
tram.cpp:30:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 | #define rep(i, n) for(int i = 0; i < n; ++i)
......
   93 |             rep(i,sz(v)-1){
      |                 ~~~~~~~~~           
tram.cpp:93:13: note: in expansion of macro 'rep'
   93 |             rep(i,sz(v)-1){
      |             ^~~
tram.cpp:114:42: warning: iteration 1 invokes undefined behavior [-Waggressive-loop-optimizations]
  114 |                             if(here[r][j2]){
      |                                ~~~~~~~~~~^
tram.cpp:31:37: note: within this loop
   31 | #define rep1(i, n) for(int i = 1; i <= n; ++i)
......
  113 |                         rep1(j2,2){
      |                              ~~~~    
tram.cpp:113:25: note: in expansion of macro 'rep1'
  113 |                         rep1(j2,2){
      |                         ^~~~
tram.cpp:125:42: warning: iteration 1 invokes undefined behavior [-Waggressive-loop-optimizations]
  125 |                             if(here[r][j2]){
      |                                ~~~~~~~~~~^
tram.cpp:31:37: note: within this loop
   31 | #define rep1(i, n) for(int i = 1; i <= n; ++i)
......
  124 |                         rep1(j2,2){
      |                              ~~~~    
tram.cpp:124:25: note: in expansion of macro 'rep1'
  124 |                         rep1(j2,2){
      |                         ^~~~

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 0 / 15
• Subtask 8: 0 / 20