Submission #1260737

#	Time	Username	Problem	Language	Result	Execution time	Memory
1260737		riddles	World Map (IOI25_worldmap)	C++20	7 / 100	3 ms	836 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;

/*void dfs(int u, int p) {
    etour.pb(u);
    for (int i: con[u]) {
        if (i!=p) {
            dfs(i, u);
            etour.pb(u);
        }
    }
}*/

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);
  /*for(ll i=0; i<m; i++){
    a[i]--, b[i]--;
    con[a[i]].pb(b[i]);
    con[b[i]].pb(a[i]);
  }

  vector<int> tour;
	auto dfs = [&](auto& self, int x, int pre) -> void {
		tour.push_back(x);
		for (int i : con[x]) {
			if (i != pre) {
				self(self, i, x);
				tour.push_back(x);
			}
		}
	};
	dfs(dfs, 0, -1);*/
  ans=vector<vector<int>> (n, vector<int>(n, 1));
  int x=0, y=0;
  for(ll i=0; i<n; i++){
    for(ll j=i+1; j<n; j++){
      ans[x][y]=i+1;
      ans[x][y+1]=j+1;
      y+=2;
      if(y>=n-1) y=0, x++;
    }
  }
  return ans;
}

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