제출 #465239

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
465239		mario05092929	Teleporters (IOI08_teleporters)	C++11	10 / 100	403 ms	35796 KiB

teleporters

#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+1]) 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]) 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;
}

컴파일 시 표준 에러 (stderr) 메시지

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
• Subtask 2: 0 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 5 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 5 / 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