oj.uz

Submission #465229

# Submission time Handle Problem Language Result Execution time Memory
465229 2021-08-15T12:07:43 Z mario05092929 Teleporters (IOI08_teleporters) C++11
20 / 100
 399 ms 34780 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[2000005],ans;
int n,k,End = 2000002;
int p[2000005];

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;
        p[x] = y, p[y] = x;
    }
    ans = go(0);
    vec v;
    c[End] = 1;
    for(int i = 1;i <= End;i++) if(!c[i]) v.pb(go(i));
    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:48:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for(int i = 0;i < v.size()&&i < k;i++) ans += v[i]+2;
      |                   ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
0 / 5.0

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

Subtask #4
0 / 5.0

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

Subtask #5
0 / 5.0

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

Subtask #6
0 / 5.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
0 / 5.0

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

Subtask #9
0 / 5.0

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

Subtask #10
0 / 5.0

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

Subtask #11
5.0 / 5.0

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

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 8168 KB Output is correct
2 Incorrect 14 ms 8516 KB Output isn't correct

Subtask #13
0 / 5.0

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

Subtask #14
0 / 5.0

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

Subtask #15
0 / 5.0

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

Subtask #16
0 / 5.0

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

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 16524 KB Output is correct
2 Incorrect 213 ms 23100 KB Output isn't correct

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 27324 KB Output is correct
2 Incorrect 300 ms 28992 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

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

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 399 ms 34780 KB Output is correct
2 Incorrect 361 ms 34760 KB Output isn't correct
3 Halted 0 ms 0 KB -