제출 #1305780

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1305780		georgeckito	이주 (IOI25_migrations)	C++20	30 / 100	36 ms	452 KiB

migrations

#include "migrations.h"
#include <bits/stdc++.h>
int d[100001];
int ans;
int ansN;
int l;
int send_message(int N, int i, int Pi)
{
  if (i == 1)
  {
    d[0] = 0;
    ans = 0;
    ansN = 0;
    l=0;
  }
  d[i] = d[Pi] + 1;
  if (d[i] > ans)
  {
    ans = d[i];
    ansN = i;
  }
  if(i < N-7) {
  	return 0;
	}
	if(d[i] == ans) return 4;
	
	if(i == N-7) l = ansN;
	int kk = l%4;
 	l = l/4;
 	return kk;
}

std::pair<int, int> longest_path(std::vector<int> S)
{
  int n = S.size();
  int aans = -1;
  for (int i = n-7; i < n; i++)
  {
    if (S[i] == 4)
    {
      aans = i;
    }
  }
  if(aans != -1) return {0, aans};
  aans = 0;
  int c = 1;
  for(int i = n-7; i < n; i++) {
  	aans += S[i]*c;
  	c = c * 4;
	}
	return {0, aans};
	
}

• Subtask 0: 0 / 0
• Subtask 1: 30 / 30
• Subtask 2: 0 / 70