oj.uz

Submission #864058

# Submission time Handle Problem Language Result Execution time Memory
864058 2023-10-21T19:04:42 Z manizare Arranging Tickets (JOI17_arranging_tickets) C++14
100 / 100
 87 ms 28952 KB 
#include <bits/stdc++.h> 
 
#pragma GCC optimize("O3,unroll-loops")
#define pb push_back
#define F first
#define S second 
#define all(a) a.begin(),a.end()
#define pii pair <int,int>
#define Pii pair< pii , pii >
#define int long long
using namespace std ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 6e5 + 10 , sq = 3 , maxq = 1e7 + 1 ,  inf = 1e18 + 10 , mod= 998244353 ,lg = 20 ;
vector <pair <pii , int> >  ed ;
vector <int> vec[maxn] ;
int pr[maxn] , n , m ; 
int ch(int val){
  for(int i = 0 ; i < n ; i++){
    pr[i] = 0 ;
  }
  for(int i =0 ; i < ed.size() ; i++){
    pr[ed[i].F.F]+= ed[i].S ; 
    pr[ed[i].F.S]-= ed[i].S ; 
  }
  priority_queue <pair <int  ,pii>  > pq ;
  int w = 0 , ans = 0 ; 
  for(int i = 0 ; i < n ; i++){
    if(i)pr[i] += pr[i-1] ; 
    for(int j = 0  ; j < vec[i].size() ; j++){
      pq.push({ed[vec[i][j]].F.S , {vec[i][j] , ed[vec[i][j]].S}});
    }
    while(pr[i] > val){
      int v = pq.top().S.F , ted = pq.top().S.S; ; 
      pq.pop() ;
      if(ed[v].F.S < i)continue ;
      if(pr[i]-2*ted > val){
        pr[i]-=2*ted;
        pr[ed[v].F.S]+= 2*ted ;
        ans += ted;  
      }else{
        int gp = (pr[i] - val + 1)/2  ;
        pr[i] -= 2*gp ;
        pr[ed[v].F.S]+= 2*gp ;
        ans += gp ; 
        pq.push({ed[v].F.S , {v , ted-gp}})  ;      
      }
    }
  }
  return ans ; 
}
 
signed main() {
  ios::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0) ;
  cin >> n >> m ;
  for(int i =1 ; i <= m ; i++){
    int a , b , c; 
    cin >> a >> b >> c ;
    if(a > b)swap(a , b) ;
    a--;
    b--;
    pr[a]+=c;
    pr[b]-=c;
    ed.pb({{a, b} , c}) ;
  }
  for(int i = 1; i< n  ;i++){
    pr[i]+= pr[i-1] ; 
  }
  int mx= 0 ; 
  for(int i = 0 ; i < n ; i++){
    if(pr[i] > pr[mx])mx = i ;
  }
  for(int i =0 ; i < ed.size() ; i++){
    ed[i].F.F = (ed[i].F.F - mx - 1+ n)%n ;
    ed[i].F.S = (ed[i].F.S - mx - 1 + n)%n ;
    if(ed[i].F.F  > ed[i].F.S)swap(ed[i].F.F  , ed[i].F.S); 
    vec[ed[i].F.F].pb(i) ;
  }
  cout << min(ch(0) , ch(1)+1) << "\n" ;
}
/*
 
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 3 ms 14736 KB Output is correct
14 Correct 3 ms 15096 KB Output is correct
15 Correct 3 ms 14940 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 3 ms 14736 KB Output is correct
14 Correct 3 ms 15096 KB Output is correct
15 Correct 3 ms 14940 KB Output is correct
16 Correct 3 ms 14940 KB Output is correct
17 Correct 4 ms 14940 KB Output is correct
18 Correct 3 ms 14936 KB Output is correct
19 Correct 3 ms 14940 KB Output is correct
20 Correct 3 ms 14940 KB Output is correct
21 Correct 3 ms 14940 KB Output is correct
22 Correct 3 ms 14940 KB Output is correct
23 Correct 3 ms 14940 KB Output is correct
24 Correct 3 ms 14940 KB Output is correct
25 Correct 3 ms 14940 KB Output is correct
26 Correct 3 ms 14940 KB Output is correct
27 Correct 3 ms 15004 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 3 ms 14736 KB Output is correct
14 Correct 3 ms 15096 KB Output is correct
15 Correct 3 ms 14940 KB Output is correct
16 Correct 3 ms 14940 KB Output is correct
17 Correct 4 ms 14940 KB Output is correct
18 Correct 3 ms 14936 KB Output is correct
19 Correct 3 ms 14940 KB Output is correct
20 Correct 3 ms 14940 KB Output is correct
21 Correct 3 ms 14940 KB Output is correct
22 Correct 3 ms 14940 KB Output is correct
23 Correct 3 ms 14940 KB Output is correct
24 Correct 3 ms 14940 KB Output is correct
25 Correct 3 ms 14940 KB Output is correct
26 Correct 3 ms 14940 KB Output is correct
27 Correct 3 ms 15004 KB Output is correct
28 Correct 4 ms 15196 KB Output is correct
29 Correct 4 ms 15196 KB Output is correct
30 Correct 5 ms 15244 KB Output is correct
31 Correct 4 ms 15196 KB Output is correct
32 Correct 5 ms 15196 KB Output is correct
33 Correct 5 ms 15196 KB Output is correct
34 Correct 4 ms 15196 KB Output is correct
35 Correct 4 ms 15196 KB Output is correct
36 Correct 5 ms 15196 KB Output is correct
37 Correct 4 ms 15196 KB Output is correct
38 Correct 4 ms 15192 KB Output is correct
39 Correct 4 ms 15448 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 3 ms 14736 KB Output is correct
14 Correct 3 ms 15096 KB Output is correct
15 Correct 3 ms 14940 KB Output is correct
16 Correct 3 ms 14940 KB Output is correct
17 Correct 4 ms 14940 KB Output is correct
18 Correct 3 ms 14936 KB Output is correct
19 Correct 3 ms 14940 KB Output is correct
20 Correct 3 ms 14940 KB Output is correct
21 Correct 3 ms 14940 KB Output is correct
22 Correct 3 ms 14940 KB Output is correct
23 Correct 3 ms 14940 KB Output is correct
24 Correct 3 ms 14940 KB Output is correct
25 Correct 3 ms 14940 KB Output is correct
26 Correct 3 ms 14940 KB Output is correct
27 Correct 3 ms 15004 KB Output is correct
28 Correct 4 ms 15196 KB Output is correct
29 Correct 4 ms 15196 KB Output is correct
30 Correct 5 ms 15244 KB Output is correct
31 Correct 4 ms 15196 KB Output is correct
32 Correct 5 ms 15196 KB Output is correct
33 Correct 5 ms 15196 KB Output is correct
34 Correct 4 ms 15196 KB Output is correct
35 Correct 4 ms 15196 KB Output is correct
36 Correct 5 ms 15196 KB Output is correct
37 Correct 4 ms 15196 KB Output is correct
38 Correct 4 ms 15192 KB Output is correct
39 Correct 4 ms 15448 KB Output is correct
40 Correct 61 ms 25160 KB Output is correct
41 Correct 61 ms 25076 KB Output is correct
42 Correct 86 ms 24932 KB Output is correct
43 Correct 67 ms 24796 KB Output is correct
44 Correct 63 ms 25152 KB Output is correct
45 Correct 60 ms 24560 KB Output is correct
46 Correct 68 ms 24764 KB Output is correct
47 Correct 58 ms 24388 KB Output is correct
48 Correct 55 ms 24660 KB Output is correct
49 Correct 48 ms 27596 KB Output is correct
50 Correct 40 ms 28196 KB Output is correct
51 Correct 54 ms 27160 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 3 ms 14736 KB Output is correct
14 Correct 3 ms 15096 KB Output is correct
15 Correct 3 ms 14940 KB Output is correct
16 Correct 3 ms 14940 KB Output is correct
17 Correct 4 ms 14940 KB Output is correct
18 Correct 3 ms 14936 KB Output is correct
19 Correct 3 ms 14940 KB Output is correct
20 Correct 3 ms 14940 KB Output is correct
21 Correct 3 ms 14940 KB Output is correct
22 Correct 3 ms 14940 KB Output is correct
23 Correct 3 ms 14940 KB Output is correct
24 Correct 3 ms 14940 KB Output is correct
25 Correct 3 ms 14940 KB Output is correct
26 Correct 3 ms 14940 KB Output is correct
27 Correct 3 ms 15004 KB Output is correct
28 Correct 4 ms 15196 KB Output is correct
29 Correct 4 ms 15196 KB Output is correct
30 Correct 5 ms 15244 KB Output is correct
31 Correct 4 ms 15196 KB Output is correct
32 Correct 5 ms 15196 KB Output is correct
33 Correct 5 ms 15196 KB Output is correct
34 Correct 4 ms 15196 KB Output is correct
35 Correct 4 ms 15196 KB Output is correct
36 Correct 5 ms 15196 KB Output is correct
37 Correct 4 ms 15196 KB Output is correct
38 Correct 4 ms 15192 KB Output is correct
39 Correct 4 ms 15448 KB Output is correct
40 Correct 61 ms 25160 KB Output is correct
41 Correct 61 ms 25076 KB Output is correct
42 Correct 86 ms 24932 KB Output is correct
43 Correct 67 ms 24796 KB Output is correct
44 Correct 63 ms 25152 KB Output is correct
45 Correct 60 ms 24560 KB Output is correct
46 Correct 68 ms 24764 KB Output is correct
47 Correct 58 ms 24388 KB Output is correct
48 Correct 55 ms 24660 KB Output is correct
49 Correct 48 ms 27596 KB Output is correct
50 Correct 40 ms 28196 KB Output is correct
51 Correct 54 ms 27160 KB Output is correct
52 Correct 77 ms 24320 KB Output is correct
53 Correct 87 ms 24676 KB Output is correct
54 Correct 74 ms 24528 KB Output is correct
55 Correct 68 ms 24260 KB Output is correct
56 Correct 79 ms 24392 KB Output is correct
57 Correct 65 ms 24128 KB Output is correct
58 Correct 62 ms 23888 KB Output is correct
59 Correct 57 ms 28952 KB Output is correct