oj.uz

Submission #865912

# Submission time Handle Problem Language Result Execution time Memory
865912 2023-10-25T03:01:13 Z HuyQuang_re_Zero Teleporters (IOI08_teleporters) C++14
85 / 100
 1000 ms 65536 KB 
#include <bits/stdc++.h>
#define ll long long
#define db long double
#define N 1000005
#define II pair <int,int>
#define III pair <ll,II>
#define IV pair <vector <int>,vector <int> >
#define fst first
#define snd second
#define BIT(x,i) ((x>>i)&1)
#define Log(x) (31-__builtin_clz((int)x))
#define LogLL(x) (63-__builtin_clzll((ll)x))
#define pi acos(-1)
#define to_radian(x) (x*pi/180.0)
#define to_degree(x) (x*180.0/pi)
using namespace std;
int n,m,End[2*N],From[2*N],i,u,sz,l,r,res,nxt[2*N],node,last;
bool visited[N];
II a[2*N];
int rev(int u) { return (u<=n) ? u+n : u-n; }
int main()
{
 //   freopen("teleporters.inp","r",stdin);
  //  freopen("teleporters.out","w",stdout);
    cin>>n>>m;
    a[++sz]={ 0,0 }; a[++sz]={ 2000001,2*n+1 };
    for(i=1;i<=n;i++)
    {
        scanf("%d%d",&l,&r);
        a[++sz]={ l,i }; a[++sz]={ r,rev(i) };
    }
    sort(a+1,a+sz+1);
    for(i=2;i<=sz;i++) End[++node]=a[i].snd,From[a[i-1].snd]=node;
    for(u=1;u<=node;u++) nxt[u]=From[rev(End[u])];
    for(u=1;u<node;u=nxt[u]) visited[u]=1,res++;
    visited[node]=1;


    vector <int> val;
    for(u=2;u<=node;u++)
        if(visited[u]==0)
        {
            int v=nxt[u],edge=0;
            while(v!=u) visited[v]=1,edge++,v=nxt[v];
            visited[v]=1,edge++;
            val.push_back(edge);
        }

    sort(val.begin(),val.end());
    for(i=1;i<=m;i++)
        if(val.size()>0)
        {
            int k=val.back(); val.pop_back();
            res+=k+2;
        }
        else
        {
            res++;
            val.push_back(1);
        }
    cout<<res;
}

Compilation message

teleporters.cpp: In function 'int main()':
teleporters.cpp:29:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |         scanf("%d%d",&l,&r);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

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

Subtask #11
5.0 / 5.0

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

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 3 ms 4952 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4696 KB Output is correct
2 Correct 5 ms 7004 KB Output is correct
3 Correct 9 ms 7152 KB Output is correct

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7004 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 12492 KB Output is correct
2 Correct 99 ms 19940 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 15312 KB Output is correct
2 Correct 148 ms 26024 KB Output is correct

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1034 ms 33624 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 407 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1026 ms 40296 KB Time limit exceeded
2 Halted 0 ms 0 KB -