oj.uz

답안 #766451

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
766451 2023-06-25T16:32:15 Z Znb_Jfrian Arranging Tickets (JOI17_arranging_tickets) C++14
65 / 100
 1293 ms 6312 KB 
//______________"In The Name Of GOD"______________

#include <bits/stdc++.h>
using namespace std;


typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pll;
typedef pair <int, int> pii;


const int lg        = 20;
const int mod       = 1e9 + 7;
const ll  inf       = 1e9 + 100;
const int maxn      = 3e3 + 100;
    

#define cl       	clear
#define F        	first
#define S       	second
#define pb       	push_back
#define Sz(x)    	int((x).size())
#define all(x)   	(x).begin(), (x).end()

int a[maxn], b[maxn], ps[maxn], q, n;
vector <int> vc[maxn];
multiset <int> s;

inline int cal(int ind){
    fill(ps, ps + n, 0);
    s.cl();
    for(int i = 0; i < n; i ++) vc[i].cl();
    for(int i = 0; i < q; i ++) a[i] = (a[i] - ind + n) % n, b[i] = (b[i] - ind + n) % n;
    for(int i = 0; i < q; i ++) {
        ps[min(a[i], b[i])] ++;
        ps[max(a[i], b[i])] --;
        vc[min(a[i], b[i])].pb(max(a[i], b[i]));
    }
    int ans = 0;
    for(int i = 0; i < n; i ++){
        while(!s.empty() && *s.begin() == i) s.erase(s.begin());
        if(i) ps[i] += ps[i - 1];
        for(auto x : vc[i]) s.insert(x);
        while(!s.empty() && ps[i] > 0){
            int t = *s.rbegin();
            ps[i] -= 2, ps[t] += 2;
            s.erase(s.find(t));
            ans ++;
        }
    }
    for(int i = 0; i < q; i ++) a[i] = (a[i] + ind + n) % n, b[i] = (b[i] + ind + n) % n;
    return ans;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
    cin >> n >> q;
    for(int i = 0, c; i < q; i ++) cin >> a[i] >> b[i] >> c, a[i] --, b[i] --;
    int ans = inf;
    for(int i = 0; i < n; i ++) ans = min(ans, cal(i));
    cout << ans << '\n';
    return 0;
}

/*test case :

*/

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 392 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 400 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 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 392 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 400 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 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 10 ms 392 KB Output is correct
17 Correct 10 ms 340 KB Output is correct
18 Correct 10 ms 340 KB Output is correct
19 Correct 10 ms 416 KB Output is correct
20 Correct 10 ms 340 KB Output is correct
21 Correct 10 ms 340 KB Output is correct
22 Correct 12 ms 396 KB Output is correct
23 Correct 10 ms 432 KB Output is correct
24 Correct 10 ms 340 KB Output is correct
25 Correct 10 ms 424 KB Output is correct
26 Correct 9 ms 340 KB Output is correct
27 Correct 10 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 392 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 400 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 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 10 ms 392 KB Output is correct
17 Correct 10 ms 340 KB Output is correct
18 Correct 10 ms 340 KB Output is correct
19 Correct 10 ms 416 KB Output is correct
20 Correct 10 ms 340 KB Output is correct
21 Correct 10 ms 340 KB Output is correct
22 Correct 12 ms 396 KB Output is correct
23 Correct 10 ms 432 KB Output is correct
24 Correct 10 ms 340 KB Output is correct
25 Correct 10 ms 424 KB Output is correct
26 Correct 9 ms 340 KB Output is correct
27 Correct 10 ms 468 KB Output is correct
28 Correct 1185 ms 696 KB Output is correct
29 Correct 1165 ms 676 KB Output is correct
30 Correct 1218 ms 716 KB Output is correct
31 Correct 1149 ms 920 KB Output is correct
32 Correct 1125 ms 888 KB Output is correct
33 Correct 1248 ms 3512 KB Output is correct
34 Correct 1209 ms 3560 KB Output is correct
35 Correct 1293 ms 6312 KB Output is correct
36 Correct 1271 ms 3520 KB Output is correct
37 Correct 833 ms 552 KB Output is correct
38 Correct 669 ms 544 KB Output is correct
39 Correct 802 ms 540 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 392 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 400 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 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 10 ms 392 KB Output is correct
17 Correct 10 ms 340 KB Output is correct
18 Correct 10 ms 340 KB Output is correct
19 Correct 10 ms 416 KB Output is correct
20 Correct 10 ms 340 KB Output is correct
21 Correct 10 ms 340 KB Output is correct
22 Correct 12 ms 396 KB Output is correct
23 Correct 10 ms 432 KB Output is correct
24 Correct 10 ms 340 KB Output is correct
25 Correct 10 ms 424 KB Output is correct
26 Correct 9 ms 340 KB Output is correct
27 Correct 10 ms 468 KB Output is correct
28 Correct 1185 ms 696 KB Output is correct
29 Correct 1165 ms 676 KB Output is correct
30 Correct 1218 ms 716 KB Output is correct
31 Correct 1149 ms 920 KB Output is correct
32 Correct 1125 ms 888 KB Output is correct
33 Correct 1248 ms 3512 KB Output is correct
34 Correct 1209 ms 3560 KB Output is correct
35 Correct 1293 ms 6312 KB Output is correct
36 Correct 1271 ms 3520 KB Output is correct
37 Correct 833 ms 552 KB Output is correct
38 Correct 669 ms 544 KB Output is correct
39 Correct 802 ms 540 KB Output is correct
40 Runtime error 2 ms 980 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 392 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 400 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 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 10 ms 392 KB Output is correct
17 Correct 10 ms 340 KB Output is correct
18 Correct 10 ms 340 KB Output is correct
19 Correct 10 ms 416 KB Output is correct
20 Correct 10 ms 340 KB Output is correct
21 Correct 10 ms 340 KB Output is correct
22 Correct 12 ms 396 KB Output is correct
23 Correct 10 ms 432 KB Output is correct
24 Correct 10 ms 340 KB Output is correct
25 Correct 10 ms 424 KB Output is correct
26 Correct 9 ms 340 KB Output is correct
27 Correct 10 ms 468 KB Output is correct
28 Correct 1185 ms 696 KB Output is correct
29 Correct 1165 ms 676 KB Output is correct
30 Correct 1218 ms 716 KB Output is correct
31 Correct 1149 ms 920 KB Output is correct
32 Correct 1125 ms 888 KB Output is correct
33 Correct 1248 ms 3512 KB Output is correct
34 Correct 1209 ms 3560 KB Output is correct
35 Correct 1293 ms 6312 KB Output is correct
36 Correct 1271 ms 3520 KB Output is correct
37 Correct 833 ms 552 KB Output is correct
38 Correct 669 ms 544 KB Output is correct
39 Correct 802 ms 540 KB Output is correct
40 Runtime error 2 ms 980 KB Execution killed with signal 11
41 Halted 0 ms 0 KB -