Submission #1260716

#	Time	Username	Problem	Language	Result	Execution time	Memory
1260716		riddles	World Map (IOI25_worldmap)	C++20	0 / 100	1140 ms	2162688 KiB

worldmap

#include "worldmap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef map<ll, ll> mp;
typedef pair<ll, ll> pll;
typedef queue<ll> qi;
typedef vector<ll> vi;
typedef vector <vi> vvi;
typedef vector <pll> vpl;
typedef vector <string> vs;
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define f first
#define s second
#define pb push_back
#define all(x) begin(x), end(x)

int n, m;
vector<int> a, b;
vector<vector<int>> ans;
vector<vector<int>> con;
vector<int> etour;
vi tint, tout;
int tim=0;


void dfs(int u, int p=-1){
  tint[u]=tim++;
  etour.pb(u);
  for(int v: con[u]){
    if(v==p) continue;
    dfs(v, u);
    etour.pb(u);
  }
  tout[u]=tim++;
}

vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B) {
  n=N;
  m=M;
  a=A;
  b=B;
  con=vector<vector<int>> (n);
  tint=vi(n);
  tout=vi(n);

  for(ll i=0; i<m; i++){
    a[i]--, b[i]--;
    con[a[i]].pb(b[i]);
    con[b[i]].pb(a[i]);
  }

  dfs(0);

  ans=vector<vector<int>> (2*n-1, vector<int>(2*n-1, 1));
  for(ll i=0; i<2*n-1; i++) for(ll j=0; j<2*n-1; j++) ans[i][j]=etour[j]+1;
  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