oj.uz

답안 #831449

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831449 2023-08-20T09:09:55 Z Paul_Liao_1457 Arranging Tickets (JOI17_arranging_tickets) C++17
0 / 100
 0 ms 212 KB 
#include<iostream>
#include<array>
#include<vector>
#include<string>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
#include<unordered_map>
#include<cstring>
#include<iomanip>
#include<bitset>
#include<tuple>
#include<chrono>
#include<random>
 
#define ll long long
#define DB double
#define pii pair<int, int>
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define INF (ll)(1e9+5)
#define MOD (ll)(998244353)
#define endl "\n"
#define AC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define N 200005
#define M 200005
 
using namespace std;
 
int sum[N];
int n, m; 
 
int used[N];
 
pair<int, int>  find(int maxn) {
    int l = n+1, r = 1;
    FOR(i, 1, n+1) {
        if (sum[i] >= maxn - 1) {
            l = min(l, i);
            r = max(r, i);
        }
    }
    return mp(l, r);
}
 
int main() {
    AC;
 
    cin >> n >> m;
 
    int maxn = 0;
    ll ans = 0;
 
    vector<pair<int, int> > v;
 
    FOR(i, 0, m) {
        int a, b, c; cin >> a >> b >> c;
        if (a > b) swap(a, b);
 
        //ans += c / 2;
        //c %= 2;
        //if (!c) continue;
 
        v.pb(mp(a, b));
 
        FOR(j, a, b) {
            sum[j]++;
            maxn = max(maxn, sum[j]);
        }
 
    }
 
    int l, r;
 
    while (1) {
       pair<int, int> tmp = find(maxn); 
       l = tmp.F; r = tmp.S;
 
       bool ok = 0;
 
       FOR(i, 0, v.size()) {
           if (!used[i]){
               if (v[i].F <= l && v[i].S > r) {
                   ok = 1;
                   used[i] = 1;
                   maxn--;
                   FOR(j, 1, n+1) {
                       if (v[i].F <= j && j < v[i].S) sum[j]--;
                       else sum[j]++;
                   }
                   break;
               }
           } else {
               bool ck = 1;
               FOR(j, v[i].F, v[i].S) {
                   if (sum[j] >= maxn - 1) {
                       ck = 0;
                       break;
                   }
               }
               if (ck) {
                   ok = 1;
                   used[i] = 0;
                   maxn--;
                   FOR(j, 1, n+1) {
                       if (v[i].F <= j && j < v[i].S) sum[j]++;
                       else sum[j]--;
                   }
                   break;
               }
           }
 
       }
       if (!ok) break;
    }
 
    cout << ans + maxn << endl;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -