# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
121459 | TadijaSebez | Teleporters (IOI08_teleporters) | C++11 | 992 ms | 56232 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
#define pb push_back
const int N=1000050;
const int M=2*N;
int x[M],my[M];
vector<int> id;
int go[M];
bool comp(int i, int j){ return x[i]<x[j];}
bool was[M];
int sz;
void DFS(int u)
{
if(was[u]) return;
was[u]=1;if(u!=1) sz++;
if(go[u]) DFS(go[u]);
}
int main()
{
int n,m,i;
scanf("%i %i",&n,&m);
for(i=1;i<=n;i++)
{
id.pb(i<<1);
id.pb(i<<1|1);
scanf("%i %i",&x[i<<1],&x[i<<1|1]);
}
sort(id.begin(),id.end(),comp);
id.pb(1);
for(i=0;i<id.size();i++) my[id[i]]=i;
for(i=0;i<id.size()-1;i++)
{
int g=id[i]^1;
int p=my[g];
go[id[i]]=id[p+1];
}
DFS(id[0]);
int path=sz;
//printf("path:%i\n",path);
vector<int> cyc;
for(i=1;i<id.size()-1;i++)
{
if(!was[id[i]]) sz=0,DFS(id[i]),cyc.pb(sz);//,printf("cycle:%i\n",sz);
}
int sol=path;
sort(cyc.rbegin(),cyc.rend());
int k=0;
for(i=0;i<m && i<cyc.size();i++)
{
sol+=cyc[i]+2;
k++;
}
m-=k;
int ok=0;
while(m--)
{
if(ok) sol+=3;
else sol+=1;
ok^=1;
}
printf("%i\n",sol);
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |