Submission #239216

#	Time	Username	Problem	Language	Result	Execution time	Memory
239216		osaaateiasavtnl	Teleporters (IOI08_teleporters)	C++14	10 / 100	1095 ms	65540 KiB

teleporters

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC

const int INF = 1e9+7;

int get(vector <ii> a) {
    /*    
    cout << "get : " << endl;
    for (auto e : a)
        cout << e.f << ' ' << e.s << endl;
    cout << endl;
    */
    int n = a.size();
    map <int, int> who;
    vector <int> c = {0, INF}; 
    for (int i = 0; i < n; ++i) {
        c.app(a[i].f);
        c.app(a[i].s);
        who[a[i].f] = i;
        who[a[i].s] = i;
    }   
    sort(all(c));
 
    int sz = c.size() - 1;
    vector <int> to(sz, -1);
    for (int i = 0; i + 2 < c.size(); ++i) {
        int u = who[c[i+1]];
        int x = a[u].f^a[u].s^c[i+1];
        to[i] = lower_bound(all(c), x) - c.begin();
    }   
 
    int ans = 0;
 
    vector <int> len;
    vector <bool> used(sz);
    for (int i = 0; i < sz; ++i) {
        if (!used[i]) {
            int u = i;
            int l = 0;
            while (u != -1 && !used[u]) {
                used[u] = 1;
                ++l;
                u = to[u];
            }
 
            if (u == -1) {
                return l - 1;
            }   
        }   
    }
    return -1;
}

int n, m;
int solve(vector <ii> a, int h) {
    /*
    cout << "solve : " << endl;
    for (auto e : a)
        cout << e.f << ' ' << e.s << endl;
    cout << endl;
    */
    if (h == m)
        return get(a);

    vector <int> c;
    for (auto e : a) {
        c.app(e.f);
        c.app(e.s);
    }   

    int ans = 0;

    c.app(0);
    c.app(c.back()+1);
    sort(all(c));
    for (int l = 0; l + 1 < c.size(); ++l) {
        for (int r = l; r + 1 < c.size(); ++r) {
            
            int lx = c[l] + 1;
            int rx = c[r] + 2;
            vector <ii> b;
            for (auto e : a) {
                if (e.f >= c[l + 1])
                    e.f += 2;
                if (e.f >= c[r + 1])
                    e.f += 2;   

                if (e.s >= c[l + 1])
                    e.s += 2;
                if (e.s >= c[r + 1])
                    e.s += 2;   

               b.app(e);
            }   
            /*
            cout << "add " << lx << ' ' << rx << endl;
            cout << c[r] << endl;
            */
            b.app(mp(lx, rx));

            ans = max(ans, solve(b, h + 1));
            
        }   
    }
    return ans;   
}   

signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif

    cin >> n >> m;
    vector <ii> a(n);
    for (int i = 0; i < n; ++i) {
        int l, r;
        cin >> l >> r;
        a[i] = mp(l, r);
    }   

    cout << solve(a, 0) << endl;
}

Compilation message (stderr)

teleporters.cpp: In function 'long long int get(std::vector<std::pair<long long int, long long int> >)':
teleporters.cpp:36:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i + 2 < c.size(); ++i) {
                     ~~~~~~^~~~~~~~~~
teleporters.cpp:42:9: warning: unused variable 'ans' [-Wunused-variable]
     int ans = 0;
         ^~~
teleporters.cpp: In function 'long long int solve(std::vector<std::pair<long long int, long long int> >, long long int)':
teleporters.cpp:86:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int l = 0; l + 1 < c.size(); ++l) {
                     ~~~~~~^~~~~~~~~~
teleporters.cpp:87:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int r = l; r + 1 < c.size(); ++r) {
                         ~~~~~~^~~~~~~~~~

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