제출 #1307522

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1307522		shisp1	Arranging Tickets (JOI17_arranging_tickets)	C++20	10 / 100	971 ms	576 KiB

arranging_tickets

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const int mod = 1e9+7;
const int N = 2e5+5;
int n,m, A[N], B[N], c[N], pr[N];
void solve() {
    cin >> n >> m;
    for(int i = 0;i<m;i++) {
        cin >> A[i] >> B[i] >> c[i];
        A[i]--;
        B[i]--;
    }
    int best = 1e9;
    for(int mask = 0;mask<(1<<m);mask++){
        vector<int>cnt(n+1);
        for(int i = 0;i<m;i++) {
            int a = A[i], b = B[i];
            if(mask&(1<<i)) {
                int cur = a;
                while(cur!=b) {
                    cnt[cur]++;
                    cur=(cur+1)%n;
                }
            } else {
                int cur = a;
                while(cur!=b){
                    cnt[(cur-1+n)%n]++;
                    cur=(cur-1+n)%n;
                }
            }
        }
        int mx = 0;
        for(int i = 0;i<n;i++) {
            mx = max(mx,cnt[i]);
        }
        best = min(best,mx);
    }
    cout << best;

}
int main() {
    ios_base::sync_with_stdio(0);
    int tt=1;
    //cin >> tt;
    while(tt--) {
        solve();
    }





    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 35
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 15