oj.uz

답안 #768431

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768431 2023-06-28T07:08:28 Z setytousi Arranging Tickets (JOI17_arranging_tickets) C++14
45 / 100
 6000 ms 1380 KB 
#include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <sstream>
#include <numeric>
#include <cstdio>
#include <bitset>
#include <math.h>
#include <assert.h>
 
using namespace std;
#define int ll
 
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
 
const ll MAXN = 3e3 + 10;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
 
#define fast_io     ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io     freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define pb          push_back
#define F           first
#define S           second
#define Sz(x)       int((x).size())
#define all(x)      (x).begin(), (x).end()
#define cl          clear()
#define endll       '\n'

vector<pair<pii, int>> reqs;
vector<int> vec;
vector<pii> open[MAXN];
int n, m, ind[MAXN], seg[MAXN << 2];
set<pair<pii, int>> st;

void add(int l, int r, int val, int s = 0, int e = n, int v = 1){
    if (r <= s || e <= l) return;
    if (l <= s && e <= r) {
        seg[v] += val;
        return;
    }
    int mid = (s + e) >> 1, lc = v << 1, rc = lc | 1;
    add(l, r, val, s, mid, lc);
    add(l, r, val, mid, e, rc);
}
int get(int ind, int s = 0, int e = n, int v = 1){
    if (s + 1 == e) return seg[v];
    int mid = (s + e) >> 1, lc = v << 1, rc = lc | 1;
    if (ind < mid) return get(ind, s, mid, lc) + seg[v];
    else return get(ind, mid, e, rc) + seg[v];
}

inline int check(){
    for (int i = n - 1; i >= 1; i--){
        for (auto r : open[i]){
            st.insert({{r.F, i}, r.S});
        }
        while(get(i) > get(0)){
            // cout << i << ' ' << get(i) << ' ' << get(0) << endll;
            if (st.empty()) return INF;
            pair<pii, int> r = *(st.begin());
            st.erase(st.begin());
            int a = r.F.F, b = r.F.S, c = r.S;
            // cout << "hazf" << ' ' << a << ' ' << b << ' ' << c << endll;
            if (c < (get(i) - get(0) + 1) / 2){
                add(a + 1, b + 1, -c);
                add(0, a + 1, c);
                add(b + 1, n, c);
            }
            else{
                int val = (get(i) - get(0) + 1) / 2;
                add(a + 1, b + 1, -val);
                add(0, a + 1, val);
                add(b + 1, n, val);
                st.insert({{a, b}, c - val});
            }
        }
    }
    return get(0);
}

int32_t main(){
    fast_io;
    cin >> n >> m;
    for (int i = 0; i < m; i++){
        int a, b, c;
        cin >> a >> b >> c;
        reqs.pb({{a, b}, c});
    }
    int ans = INF;
    for (int i = 1; i <= n; i++){
        st.cl;
        fill(seg, seg + (MAXN << 2), 0);
        for (int j = 0; j <= n; j++) open[j].cl;
        vec.cl;
        for (int j = i; j <= n; j++) vec.pb(j);
        for (int j = 1; j < i; j++) vec.pb(j);
        for (int j = 0; j < n; j++) ind[vec[j]] = j;
        for (auto x : reqs){
            int a = x.F.F, b = x.F.S, c = x.S;
            if (ind[b] < ind[a]) swap(a, b);
            open[ind[b]].pb({ind[a], c});
            add(ind[a] + 1, ind[b] + 1, c);
        }
        ans = min(ans, check());
    }
    cout << ans << endll;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 488 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 400 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 488 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 400 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 47 ms 564 KB Output is correct
17 Correct 49 ms 572 KB Output is correct
18 Correct 48 ms 552 KB Output is correct
19 Correct 48 ms 468 KB Output is correct
20 Correct 49 ms 556 KB Output is correct
21 Correct 56 ms 468 KB Output is correct
22 Correct 49 ms 468 KB Output is correct
23 Correct 49 ms 468 KB Output is correct
24 Correct 45 ms 528 KB Output is correct
25 Correct 47 ms 588 KB Output is correct
26 Correct 45 ms 568 KB Output is correct
27 Correct 46 ms 564 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 488 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 400 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 47 ms 564 KB Output is correct
17 Correct 49 ms 572 KB Output is correct
18 Correct 48 ms 552 KB Output is correct
19 Correct 48 ms 468 KB Output is correct
20 Correct 49 ms 556 KB Output is correct
21 Correct 56 ms 468 KB Output is correct
22 Correct 49 ms 468 KB Output is correct
23 Correct 49 ms 468 KB Output is correct
24 Correct 45 ms 528 KB Output is correct
25 Correct 47 ms 588 KB Output is correct
26 Correct 45 ms 568 KB Output is correct
27 Correct 46 ms 564 KB Output is correct
28 Execution timed out 6021 ms 1380 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 488 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 400 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 47 ms 564 KB Output is correct
17 Correct 49 ms 572 KB Output is correct
18 Correct 48 ms 552 KB Output is correct
19 Correct 48 ms 468 KB Output is correct
20 Correct 49 ms 556 KB Output is correct
21 Correct 56 ms 468 KB Output is correct
22 Correct 49 ms 468 KB Output is correct
23 Correct 49 ms 468 KB Output is correct
24 Correct 45 ms 528 KB Output is correct
25 Correct 47 ms 588 KB Output is correct
26 Correct 45 ms 568 KB Output is correct
27 Correct 46 ms 564 KB Output is correct
28 Execution timed out 6021 ms 1380 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 488 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 400 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 47 ms 564 KB Output is correct
17 Correct 49 ms 572 KB Output is correct
18 Correct 48 ms 552 KB Output is correct
19 Correct 48 ms 468 KB Output is correct
20 Correct 49 ms 556 KB Output is correct
21 Correct 56 ms 468 KB Output is correct
22 Correct 49 ms 468 KB Output is correct
23 Correct 49 ms 468 KB Output is correct
24 Correct 45 ms 528 KB Output is correct
25 Correct 47 ms 588 KB Output is correct
26 Correct 45 ms 568 KB Output is correct
27 Correct 46 ms 564 KB Output is correct
28 Execution timed out 6021 ms 1380 KB Time limit exceeded
29 Halted 0 ms 0 KB -