oj.uz

Submission #862446

# Submission time Handle Problem Language Result Execution time Memory
862446 2023-10-18T09:00:25 Z manizare Arranging Tickets (JOI17_arranging_tickets) C++14
0 / 100
 1 ms 344 KB 
#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 = 4000 + 10 , maxq = 1e7 + 1 ,  inf = 1e18 + 10 , mod= 998244353 ,lg = 20 ;
vector <pii> que  ;int pr[maxn] , n ;
vector <int> k[maxn] ;
int ch(int x){
  priority_queue <int> pq ;
  for(int i =0 ; i < n ; i++){
    pr[i] =0  ;
  }
  for(int i =0 ; i < que.size() ; i++){
    int a = que[i].F , b = que[i].S ;
    a = (a-x+n)%n ;
    b = (b-x+n)%n;
    if(b < a)swap(a , b) ; 
    pr[a] ++ ;
    pr[b]-- ;
    k[a].pb(b); 
  }
  int ans =(pr[0]+1)/2 ; 
  for(int i = 1 ; i< n; i ++){
	pr[i]+=pr[i-1] ;
	ans = max(ans , (pr[i]+1)/2) ;
  }
  return ans ;
}
 
signed main(){
  int m ;
  cin >> n >> m ;
  for(int i = 1; i <= m ; i++){
    int a , b  , c; 
    cin >> a >> b >> c; 
    a--;b--;
    que.pb({a,b}) ;
  }
  int a =inf  ;
  for(int i = 0; i < n ; i++){
    a = min(a , ch(i)) ;
  }
  cout << a ;
}
/*
 
*/

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -