oj.uz

Submission #537083

# Submission time Handle Problem Language Result Execution time Memory
537083 2022-03-14T12:34:32 Z ToroTN Teleporters (IOI08_teleporters) C++14
45 / 100
 582 ms 45884 KB 
#include<bits/stdc++.h>
using namespace std;
int n,m,a[2000005],x[1000005],y[1000005],go[2000005],hsh[2000005],d[2000005],node,u,cnt,ans;
vector<int> v;
queue<int> q;
priority_queue<int> pq;
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        scanf("%d%d",&x[i],&y[i]);
        v.push_back(x[i]);
        v.push_back(y[i]);
    }
    sort(v.begin(),v.end());
    for(int i=0;i<v.size();i++)
    {
        hsh[v[i]]=i+1;
    }
    for(int i=1;i<=n;i++)
    {
        go[hsh[x[i]]]=hsh[y[i]];
        go[hsh[y[i]]]=hsh[x[i]];
    }
    memset(d,-1,sizeof d);
    d[2*n+1]=0;
    for(int i=1;i<=2*n;i++)
    {
        if(d[i]==-1)
        {
            q.push(i);
            d[i]=0;
            cnt=0;
            //printf("node=%d\n",i);
            while(!q.empty())
            {
                u=q.front();
                q.pop();
                ++cnt;
                u=go[u];
                u+=1;
                if(d[u]==-1)
                {
                    d[u]=0;
                    q.push(u);
                }else
                {
                    while(!q.empty())
                    {
                        q.pop();
                    }
                }
            }
            //printf("%d\n",cnt);
            if(i!=1)
            {
                pq.push(cnt);
            }else
            {
                ans=cnt;
            }
        }
    }
    for(int i=1;i<=m;i++)
    {
        if(pq.size()!=0)
        {
            ans+=pq.top();
            ans+=2;
            pq.pop();
        }else
        {
            ans+=3;
        }
    }
    printf("%d\n",ans);
}
/*
3
1
10 11
1 4
2 3
*/

Compilation message

teleporters.cpp: In function 'int main()':
teleporters.cpp:17:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~
teleporters.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
teleporters.cpp:12:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |         scanf("%d%d",&x[i],&y[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
0 / 5.0

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

Subtask #6
0 / 5.0

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

Subtask #7
0 / 5.0

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

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

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

Subtask #11
0 / 5.0

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

Subtask #12
0 / 5.0

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

Subtask #13
0 / 5.0

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

Subtask #14
0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 13440 KB Output is correct
2 Correct 175 ms 22600 KB Output is correct

Subtask #17
0 / 5.0

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

Subtask #18
0 / 5.0

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

Subtask #19
0 / 5.0

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

Subtask #20
0 / 5.0

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