제출 #1260317

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

arranging_tickets

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

int n,m;
int sum[21];

int check(vector<pii>& segs)
{
    rep(i,n) sum[i] = 0;
    forall(it,segs)
    {
        if(it.ff <= it.ss)
        {
            sum[it.ff]++;
            sum[it.ss]--;
        }
        else
        {
            sum[0]++;
            sum[it.ss]--;
            sum[it.ff]++;
        }
    }
    int cur_sum = 0;
    int ans = 0;
    rep(i,n)
    {
        cur_sum += sum[i];
        ans = max(ans,cur_sum);
    }
    return ans;
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    cin >> n >> m;
    vector<pii> segs;
    rep(i,m)
    {
        int a,b,c;
        cin >> a >> b >> c;
        a--;
        b--;
        segs.pb({a,b});
    }
    int ans = 1e9;
    rep(mask,(1<<m))
    {
        rep(j,m) if(mask & (1 << j)) swap(segs[j].ff,segs[j].ss);
        ans = min(ans,check(segs));
        rep(j,m) if(mask & (1 << j)) swap(segs[j].ff,segs[j].ss);
    }
    cout << ans;
}

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