Submission #1307519

#	Time	Username	Problem	Language	Result	Execution time	Memory
1307519		shisp1	Arranging Tickets (JOI17_arranging_tickets)	C++20	0 / 100	0 ms	332 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;
    int cnt1 = 0, cnt2 = 0;
    for(int i = 1;i<=m;i++) {
        cin >> a[i] >> b[i] >> c[i];
        int d1 = (b[i]-a[i]+n)%n;
        int d2 = (a[i]-b[i]+n)%n;
        if(d1 == d2) {
            if(i&1) {
                if(b[i]<a[i]){
                    pr[b[i]]++;
                    pr[a[i]]--;
                } else {
                    pr[b[i]]++;
                    pr[n+1]--;
                    pr[1]++;
                    pr[a[i]]--;
                }
            } else {
                if(b[i]>a[i]){
                    pr[a[i]]++;
                    pr[b[i]]--;
                }else {
                    pr[a[i]]++;
                    pr[n+1]--;
                    pr[1]++;
                    pr[b[i]]--;
                }
            }
        }
        else if(d1<d2){
            if(b[i]>a[i]){
                pr[a[i]]++;
                pr[b[i]]--;
            } else {
                pr[a[i]]++;
                pr[n+1]--;
                pr[1]++;
                pr[b[i]]--;
            }
            cnt1++;
        } else {
            if(b[i]<a[i]){
                pr[b[i]]++;
                pr[a[i]]--;
            } else {
                pr[b[i]]++;
                pr[n+1]--;
                pr[1]++;
                pr[a[i]]--;
            }
            cnt2++;
        }
    }
    for(int i = 1;i<=n;i++) {
        pr[i]+=pr[i-1];
    }
    int mx = 0;
    for(int i = 1;i<=n;i++) {
        mx = max(mx,pr[i]);
    }
    cout << mx << "\n";
}
int main() {
    ios_base::sync_with_stdio(0);
    int tt=1;
    //cin >> tt;
    while(tt--) {
        solve();
    }





    return 0;
}

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