oj.uz

Submission #876027

# Submission time Handle Problem Language Result Execution time Memory
876027 2023-11-21T06:06:42 Z Regulus Road Construction (JOI21_road_construction) C++17
0 / 100
 247 ms 10796 KB 
#include <bits/stdc++.h>            // pA
#define IO ios::sync_with_stdio(false);cin.tie(0);
#define debug(x) cerr << #x << " = " << (x) << ' '
#define endl cerr << '\n'
#define all(v) (v).begin(), (v).end()
#define lowbit(x) (x)&-(x)
#define pb emplace_back
#define F first
#define S second
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;

const int N = 2e5+5;
const ll INF = 1e18;
ll Seg[N<<2];
pll p[N];
vector<ll> com;

inline void build(ll L, ll R, ll v)
{
    Seg[v] = INF;
    if (L != R) build(L, (L+R)>>1, v<<1), build(((L+R)>>1)+1, R, v<<1|1);
}

inline ll query(ll L, ll R, ll ql, ll qr, ll v)
{
    if (ql > qr) return INF;
    if (ql <= L && R <= qr) return Seg[v];
    int mid((L+R)>>1);
    if (qr <= mid) return query(L, mid, ql, qr, v<<1);
    if (ql > mid) return query(mid+1, R, ql, qr, v<<1|1);
    return min(query(L, mid, ql, mid, v<<1), query(mid+1, R, mid+1, qr, v<<1|1));
}

inline void update(ll L, ll R, ll v, ll pos, ll val)
{
    if (L == R) { Seg[v] = val; return; }
    int mid((L+R)>>1);
    if (pos <= mid) update(L, mid, v<<1, pos, val);
    else update(mid+1, R, v<<1|1, pos, val);
    Seg[v] = min(Seg[v<<1], Seg[v<<1|1]);
}

int main(void)
{ IO
    ll n, i, Q, j, mn=INF, tmp, ttmp;

    cin >> n >> Q;
    if (Q != 1) assert(0);
    for (i=1; i <= n; ++i)
        cin >> p[i].F >> p[i].S, com.pb(p[i].S);

    sort(p+1, p+n+1);
    sort(all(com));
    com.resize(unique(all(com))-com.begin());

    //for (i=1; i <= n; ++i) debug(p[i].F), debug(p[i].S), endl;
    
    build(1, com.size(), 1);
    for (i=1; i <= n; ++i)
    {
        tmp = lower_bound(all(com), p[i].S) - com.begin() + 1;
        ttmp = query(1, com.size(), 1, tmp, 1);
        mn = min(mn, p[i].F+p[i].S + ttmp);
        update(1, com.size(), 1, tmp, -p[i].F-p[i].S);
    }

    build(1, com.size(), 1);
    for (i=1; i <= n; ++i)
    {
        tmp = lower_bound(all(com), p[i].S) - com.begin() + 1;
        ttmp = query(1, com.size(), tmp+1, com.size(), 1);
        mn = min(mn, p[i].F-p[i].S + ttmp);
        update(1, com.size(), 1, tmp, -p[i].F+p[i].S);
    }

    cout << mn << '\n';


    return 0;
}

Compilation message

road_construction.cpp: In function 'int main()':
road_construction.cpp:47:17: warning: unused variable 'j' [-Wunused-variable]
   47 |     ll n, i, Q, j, mn=INF, tmp, ttmp;
      |                 ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 576 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 247 ms 10796 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 247 ms 10796 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -