Submission #1262672

#	Time	Username	Problem	Language	Result	Execution time	Memory
1262672		abdelhakim	World Map (IOI25_worldmap)	C++20	0 / 100	908 ms	1659440 KiB

worldmap

#include "worldmap.h"
#include <bits/stdc++.h>
#define ll long long
#define dbg(x) cerr << #x << ' ' << x << endl;
using namespace std;

vector<int> v;
vector<vector<ll>> adj;
void dfs(ll node, ll par)
{
  v.push_back(node+1);
  for (auto &&e : adj[node])
  {
    if(e!=par)
    {
      dfs(e,node);
      v.push_back(node+1);
    }
  }
}
std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) 
{
  v.clear();
  adj.assign(N,vector<ll>());
  for (int i=0;i<M;i++)
  {
    A[i]--;
    B[i]--;
    adj[A[i]].push_back(B[i]);
    adj[B[i]].push_back(A[i]);
  }
  dfs(0,0);
  vector<vector<int>> ans(v.size()+2*N,vector<int>(v.size()+2*N));
  ll sz=v.size()+2*N;
  vector<bool> vis(N);
  for (int i=0,j=0;i<ans.size()&&j<v.size();i++,j++)
  {
    vector<int> toadd(sz,v[j]);
    ans[i]=toadd;
    if(!vis[v[j]-1])
    {
      vis[v[j]-1]=1;
      i++;
      vector<int> one(sz,adj[v[j]-1][0]+1);
      for (int k=1;k<adj[v[j]-1].size();k++)
      {
        one[k]=adj[v[j]-1][k]+1;
      }
      ans[i]=one;
      i++;
      vector<int> two(sz,v[j]);
      ans[i]=two;
    }
  }
  return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 7
• Subtask 4: 0 / 8
• Subtask 5: 0 / 14
• Subtask 6: 0 / 56