oj.uz

Submission #959090

# Submission time Handle Problem Language Result Execution time Memory
959090 2024-04-07T13:23:06 Z Abito Arranging Tickets (JOI17_arranging_tickets) C++17
0 / 100
 1 ms 4440 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
#define int long long
#define ll long long
typedef unsigned long long ull;
using namespace std;
const int N=2e5+5;
int a[N],b[N],n,m,f[N];
bool inv[N];
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin>>n>>m;
    int ans=n;
    for (int i=1;i<=m;i++){
        cin>>a[i]>>b[i];
        a[i]--;
        b[i]-=2;
        int c;cin>>c;
        if (a[i]>b[i]) swap(a[i],b[i]);
        for (int j=a[i];j<=b[i];j++) f[j]++;
    }
    while (true){
        int idx=0,best=0,mx=0;
        for (int i=0;i<n;i++) mx=max(mx,f[i]);
        for (int i=1;i<=m;i++){
            if (inv[i]) continue;
            for (int j=a[i];j<=b[i];j++) f[j]--;
            for (int j=0;j<n;j++) if (j<a[i] || j>b[i]) f[j]++;
            int mxx=0;
            for (int j=0;j<n;j++) mxx=max(mxx,f[j]);
            if (mxx<mx && b[i]-a[i]+1>best) best=b[i]-a[i]+1,idx=i;
            for (int j=a[i];j<=b[i];j++) f[j]++;
            for (int j=0;j<n;j++) if (j<a[i] || j>b[i]) f[j]--;
        }
        if (!idx) break;
        inv[idx]=1;
        for (int j=a[idx];j<=b[idx];j++) f[j]--;
        for (int j=0;j<n;j++) if (j<a[idx] || j>b[idx]) f[j]++;
    }
    sort(f,f+n);
    cout<<f[n-1]<<endl;
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4440 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 4440 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 4440 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 4440 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 4440 KB Output isn't correct
2 Halted 0 ms 0 KB -