답안 #768440

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
768440	2023-06-28T07:23:47 Z	setytousi	Arranging Tickets (JOI17_arranging_tickets)	C++14	65 / 100	2133 ms	4652 KB

arranging_tickets

#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;
 
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], fen[MAXN];
set<pair<pii, int>> st;

inline void ad(int f, int val){
    f += 5;
    for (; f < MAXN; f += f & -f) fen[f] += val;
}
inline int get(int f){
    int ans = 0;
    f += 5;
    for (; f; f -= f & -f) ans += fen[f];
    return ans;
}
inline void add(int l, int r, int val){
    r--;
    ad(l, val);
    ad(r + 1, -val);
}


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)){
            if (st.empty()) return 1000000000;
            pair<pii, int> r = *(st.begin());
            st.erase(st.begin());
            int a = r.F.F, b = r.F.S, c = r.S;
            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);
}

int 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 = 1000000000;
    for (int i = 1; i <= n; i++){
        st.cl;
        fill(fen, fen + MAXN, 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	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	372 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct

Subtask #2

35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	372 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	19 ms	448 KB	Output is correct
17	Correct	20 ms	452 KB	Output is correct
18	Correct	19 ms	460 KB	Output is correct
19	Correct	20 ms	448 KB	Output is correct
20	Correct	20 ms	452 KB	Output is correct
21	Correct	20 ms	448 KB	Output is correct
22	Correct	20 ms	456 KB	Output is correct
23	Correct	22 ms	456 KB	Output is correct
24	Correct	21 ms	460 KB	Output is correct
25	Correct	19 ms	460 KB	Output is correct
26	Correct	18 ms	340 KB	Output is correct
27	Correct	19 ms	468 KB	Output is correct

Subtask #3

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	372 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	19 ms	448 KB	Output is correct
17	Correct	20 ms	452 KB	Output is correct
18	Correct	19 ms	460 KB	Output is correct
19	Correct	20 ms	448 KB	Output is correct
20	Correct	20 ms	452 KB	Output is correct
21	Correct	20 ms	448 KB	Output is correct
22	Correct	20 ms	456 KB	Output is correct
23	Correct	22 ms	456 KB	Output is correct
24	Correct	21 ms	460 KB	Output is correct
25	Correct	19 ms	460 KB	Output is correct
26	Correct	18 ms	340 KB	Output is correct
27	Correct	19 ms	468 KB	Output is correct
28	Correct	2055 ms	1036 KB	Output is correct
29	Correct	2036 ms	976 KB	Output is correct
30	Correct	2133 ms	916 KB	Output is correct
31	Correct	1979 ms	1244 KB	Output is correct
32	Correct	1997 ms	1068 KB	Output is correct
33	Correct	2051 ms	1252 KB	Output is correct
34	Correct	1994 ms	1016 KB	Output is correct
35	Correct	1995 ms	1356 KB	Output is correct
36	Correct	2065 ms	1180 KB	Output is correct
37	Correct	1446 ms	736 KB	Output is correct
38	Correct	1099 ms	768 KB	Output is correct
39	Correct	1195 ms	756 KB	Output is correct

Subtask #4

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	372 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	19 ms	448 KB	Output is correct
17	Correct	20 ms	452 KB	Output is correct
18	Correct	19 ms	460 KB	Output is correct
19	Correct	20 ms	448 KB	Output is correct
20	Correct	20 ms	452 KB	Output is correct
21	Correct	20 ms	448 KB	Output is correct
22	Correct	20 ms	456 KB	Output is correct
23	Correct	22 ms	456 KB	Output is correct
24	Correct	21 ms	460 KB	Output is correct
25	Correct	19 ms	460 KB	Output is correct
26	Correct	18 ms	340 KB	Output is correct
27	Correct	19 ms	468 KB	Output is correct
28	Correct	2055 ms	1036 KB	Output is correct
29	Correct	2036 ms	976 KB	Output is correct
30	Correct	2133 ms	916 KB	Output is correct
31	Correct	1979 ms	1244 KB	Output is correct
32	Correct	1997 ms	1068 KB	Output is correct
33	Correct	2051 ms	1252 KB	Output is correct
34	Correct	1994 ms	1016 KB	Output is correct
35	Correct	1995 ms	1356 KB	Output is correct
36	Correct	2065 ms	1180 KB	Output is correct
37	Correct	1446 ms	736 KB	Output is correct
38	Correct	1099 ms	768 KB	Output is correct
39	Correct	1195 ms	756 KB	Output is correct
40	Runtime error	21 ms	4652 KB	Execution killed with signal 11
41	Halted	0 ms	0 KB	-

Subtask #5

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	372 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	19 ms	448 KB	Output is correct
17	Correct	20 ms	452 KB	Output is correct
18	Correct	19 ms	460 KB	Output is correct
19	Correct	20 ms	448 KB	Output is correct
20	Correct	20 ms	452 KB	Output is correct
21	Correct	20 ms	448 KB	Output is correct
22	Correct	20 ms	456 KB	Output is correct
23	Correct	22 ms	456 KB	Output is correct
24	Correct	21 ms	460 KB	Output is correct
25	Correct	19 ms	460 KB	Output is correct
26	Correct	18 ms	340 KB	Output is correct
27	Correct	19 ms	468 KB	Output is correct
28	Correct	2055 ms	1036 KB	Output is correct
29	Correct	2036 ms	976 KB	Output is correct
30	Correct	2133 ms	916 KB	Output is correct
31	Correct	1979 ms	1244 KB	Output is correct
32	Correct	1997 ms	1068 KB	Output is correct
33	Correct	2051 ms	1252 KB	Output is correct
34	Correct	1994 ms	1016 KB	Output is correct
35	Correct	1995 ms	1356 KB	Output is correct
36	Correct	2065 ms	1180 KB	Output is correct
37	Correct	1446 ms	736 KB	Output is correct
38	Correct	1099 ms	768 KB	Output is correct
39	Correct	1195 ms	756 KB	Output is correct
40	Runtime error	21 ms	4652 KB	Execution killed with signal 11
41	Halted	0 ms	0 KB	-