제출 #864044

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
864044		manizare	Arranging Tickets (JOI17_arranging_tickets)	C++14	45 / 100	6 ms	15308 KiB

arranging_tickets

#include <bits/stdc++.h> 

#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  ,int>  > 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 , ed[vec[i][j]].S });
    }
    while(pq.size() && pr[i] > val){
      int v = pq.top().F ; 
      pq.pop() ;
      pr[i]-=2 ;
      pr[v]+=2 ;
      ans++;
    }
  }
  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 ;
    a--;
    b--;
    pr[a]++;
    pr[b]--;
    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+ n)%n ;
    ed[i].F.S = (ed[i].F.S - mx + 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 / 10
• Subtask 2: 35 / 35
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 15