Submission #760418

#	Time	Username	Problem	Language	Result	Execution time	Memory
760418		GrindMachine	Tram (CEOI13_tram)	C++17	45 / 100	1080 ms	4796 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][3];
    memset(here,0,sizeof here);

    ll closest[n+5][3];
    ll active = 0;

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

            memset(closest,0x3f,sizeof closest);
            rep1(j,2){
                ll prev = -1;
                rep1(i,n){
                    if(here[i][j]){
                        prev = i;
                    }

                    if(prev != -1){
                        amin(closest[i][j], abs(i-prev));
                    }
                }

                prev = -1;

                rev(i,n,1){
                    if(here[i][j]){
                        prev = i;
                    }

                    if(prev != -1){
                        amin(closest[i][j], abs(i-prev));
                    }
                }
            }

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

            rep1(i,n){
                rep1(j,2){
                    ll mn = min(sq(closest[i][j]), sq(closest[i][3-j]) + 1);
                    if(mn > mx){
                        mx = mn;
                        px = {i,j};
                    }
                }
            }

            cout << px.ff << " " << px.ss << endl;
            sit[id] = px;
            here[px.ff][px.ss] = 1;
        }
        else{
            ll k; cin >> k;
            auto [i,j] = sit[k];
            here[i][j] = 0;
            active--;
        }
    }
}

int main()
{
    fastio;

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

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

    return 0;
}

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