제출 #583303

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
583303		hibiki	Teleporters (IOI08_teleporters)	C++11	100 / 100	418 ms	23580 KiB

teleporters

#include<bits/stdc++.h>
using namespace std;

#define pb push_back
#define f first
#define s second
#define all(x) x.begin(),x.end()

int n,m;
pair<int,int> go[2000005];
bool pass[2000005];

int main()
{
    scanf("%d %d",&n,&m);
    for(int i = 0; i < 2000005; i++)
        go[i] = {i + 1, 0};
    for(int i = 0; i < n; i++)
    {
        int a,b;
        scanf("%d %d",&a,&b);
        go[a] = {b + 1, 1};
        go[b] = {a + 1, 1};
    }

    int ans = 0;
    priority_queue<int> pq;
    pass[2000005 - 1] = true;
    for(int i = 0; i < 2000005; i++)
    {
        if(pass[i]) continue;

        int cnt = 0, nw = i;
        while(!pass[nw])
        {
            pass[nw] = true;
            cnt += go[nw].s;
            nw = go[nw].f;
        }

        if(i == 0)
            ans += cnt;
        else
        {
            // printf("%d %d\n",i,cnt);
            pq.push(cnt);
        }
    }

    while(m > 0 && !pq.empty())
    {
        ans += pq.top() + 2;
        pq.pop();
        m--;
    }
    ans += (m / 2) * 4 + (m % 2);
    printf("%d\n",ans);
    return 0;
}

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

teleporters.cpp: In function 'int main()':
teleporters.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     scanf("%d %d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~~
teleporters.cpp:21:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |         scanf("%d %d",&a,&b);
      |         ~~~~~^~~~~~~~~~~~~~~

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