oj.uz

Submission #465238

# Submission time Handle Problem Language Result Execution time Memory
465238 2021-08-15T12:17:32 Z mario05092929 Teleporters (IOI08_teleporters) C++11
10 / 100
 411 ms 35824 KB 
#include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define all(v) v.begin(),v.end()
#pragma gcc optimize("O3")
#pragma gcc optimize("Ofast") 
#pragma gcc optimize("unroll-loops")
using namespace std;
const int INF = 1e9;
const int TMX = 1 << 18;
const long long llINF = 1e16;
const long long mod = 1e9+7;
const long long hashmod = 100003;
const int MAXN = 100000;
const int MAXM = 1000000;
typedef long long ll;
typedef long double ld;
typedef pair <int,int> pi;
typedef pair <ll,ll> pl;
typedef vector <int> vec;
typedef vector <pi> vecpi;
typedef long long ll;
int c[4000005],ans;
int n,k,End = 4000002;
int p[4000005];

int go(int x) {
    if(c[x]) return 0;
    c[x] = 1;
    if(p[x]) return go(p[x]+1)+1;
    return go(x+1);
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n >> k;
    for(int i = 1;i <= n;i++) {
        int x,y; cin >> x >> y;
        x *= 2, y *= 2;
        p[x] = y, p[y] = x;
    }
    ans = go(0);
    vec v;
    c[End] = 1;
    for(int i = 1;i <= End;i++) if(!c[i]) c[i] = 1, v.pb(go(i+1));
    sort(all(v));
    reverse(all(v));
    for(int i = 0;i < v.size()&&i < k;i++) ans += v[i]+2;
    k -= min((int)v.size(),k);
    cout << ans+(k/2)*4+k%2;
}

Compilation message

teleporters.cpp:6: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
    6 | #pragma gcc optimize("O3")
      | 
teleporters.cpp:7: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
    7 | #pragma gcc optimize("Ofast")
      | 
teleporters.cpp:8: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
    8 | #pragma gcc optimize("unroll-loops")
      | 
teleporters.cpp: In function 'int main()':
teleporters.cpp:49:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |     for(int i = 0;i < v.size()&&i < k;i++) ans += v[i]+2;
      |                   ~~^~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 15948 KB Output isn't correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 15940 KB Output isn't correct

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 15900 KB Output isn't correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 15896 KB Output isn't correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 15996 KB Output isn't correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 15948 KB Output isn't correct

Subtask #7
5.0 / 5.0

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

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 15960 KB Output isn't correct

Subtask #9
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 15936 KB Output isn't correct

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 15948 KB Output isn't correct

Subtask #11
5.0 / 5.0

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

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 16032 KB Output is correct
2 Incorrect 24 ms 16424 KB Output isn't correct

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 16132 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 16204 KB Output isn't correct

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 16224 KB Output isn't correct

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 66 ms 20212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 26228 KB Output is correct
2 Incorrect 232 ms 32260 KB Output isn't correct

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 279 ms 33700 KB Output is correct
2 Incorrect 337 ms 33716 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 385 ms 33720 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 411 ms 35824 KB Output is correct
2 Incorrect 398 ms 35772 KB Output isn't correct
3 Halted 0 ms 0 KB -