제출 #446087

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
446087		JerryLiu06	Teleporters (IOI08_teleporters)	C++17	85 / 100	480 ms	65536 KiB

teleporters

#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); }
 
const int MOD = 1e9 + 7;
const int MX = 1e6 + 10;
const ll INF = 1e18;

int N, M; vpi P; vi al; int nxt[MX]; bool vis[MX]; int ans = 0; vi allCyc;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);

    cin >> N >> M; F0R(i, N) { int A, B; cin >> A >> B; P.pb({A, B}); P.pb({B, A}); al.pb(A), al.pb(B); }

    sor(al); EACH(C, P) { int ST = ub(all(al), C.f) - al.bg(), EN = ub(all(al), C.s) - al.bg(); nxt[ST] = EN == 2 * N ? -1 : (EN + 1); }

    int X = 1; while (X != -1) { vis[X] = true; ans++; X = nxt[X]; }

    FOR(i, 1, 2 * N + 1) if (!vis[i]) {
        int cycLen = 0; int X = i; 
        
        while (!vis[X]) { vis[X] = true; cycLen++; X = nxt[X]; } 
        
        allCyc.pb(cycLen);
    }
    sor(allCyc); reverse(all(allCyc));

    F0R(i, min(M, sz(allCyc))) {
        ans += allCyc[i] + 2;
    }
    if (M > sz(allCyc)) {
        ans += 2 * (M - sz(allCyc)) - (M - sz(allCyc)) % 2;
    }
    cout << ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5