oj.uz

Submission #588290

# Submission time Handle Problem Language Result Execution time Memory
588290 2022-07-03T02:23:33 Z Bench0310 Teleporters (IOI08_teleporters) C++17
100 / 100
 520 ms 42972 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,m;
    cin >> n >> m;
    vector<array<int,2>> v(2*n);
    vector<int> p(2*n,-1);
    for(int i=0;i<n;i++)
    {
        int l,r;
        cin >> l >> r;
        v[2*i]={l,2*i};
        v[2*i+1]={r,2*i+1};
    }
    sort(v.begin(),v.end());
    for(int i=0;i+1<2*n;i++) p[v[i][1]^1]=v[i+1][1];
    vector<bool> vis(2*n,0);
    vector<int> opt;
    int res=0;
    for(int i=0;i<2*n;i++)
    {
        int a=v[i][1];
        if(vis[a]) continue;
        int len=0;
        while(a!=-1&&!vis[a])
        {
            len++;
            vis[a]=1;
            a=p[a];
        }
        if(a!=-1) opt.push_back(len);
        else res+=len;
    }
    sort(opt.begin(),opt.end(),greater<>());
    for(int len:opt)
    {
        if(m>0)
        {
            res+=(len+2);
            m--;
        }
    }
    res+=(4*(m/2));
    if(m&1) res++;
    cout << res << "\n";
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 5 ms 724 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 5 ms 724 KB Output is correct
3 Correct 10 ms 1364 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 716 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 916 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 5324 KB Output is correct
2 Correct 138 ms 12292 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 8848 KB Output is correct
2 Correct 210 ms 17964 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 26296 KB Output is correct
2 Correct 377 ms 31160 KB Output is correct
3 Correct 404 ms 35676 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 452 ms 36128 KB Output is correct
2 Correct 449 ms 38768 KB Output is correct
3 Correct 468 ms 38036 KB Output is correct
4 Correct 454 ms 38576 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 493 ms 42804 KB Output is correct
2 Correct 520 ms 42972 KB Output is correct
3 Correct 389 ms 42848 KB Output is correct
4 Correct 485 ms 42836 KB Output is correct