Submission #1256541

#	Time	Username	Problem	Language	Result	Execution time	Memory
1256541		pandaa73	세계 지도 (IOI25_worldmap)	C++20	7 / 100	8 ms	1348 KiB

worldmap

#include <bits/stdc++.h>
using namespace std;

#define lf "\n"
#define ff endl
#define _ << ' ' <<
#define all(x) begin(x),end(x)
#define rall(x) rbegin(x),rend(x)

#define infos(str) do { fprintf(stderr, str"\n"); } while(0)
#define infor(str, ...) do { fprintf(stderr, str, __VA_ARGS__); } while(0)
#define infof(str, ...) do { fprintf(stderr, str"\n", __VA_ARGS__); } while(0)

#ifndef DEBUG

#undef infos
#undef infor
#undef infof

#define infos(str)
#define infor(str, ...)
#define infof(str, ...)

#endif

using ll = long long;

constexpr int LOG = 20;
constexpr int MOD = 1e9+7;
constexpr int MAXN = 1e5+7;

std::vector<std::vector<int>> create_map(int N, int M,
        std::vector<int> A, std::vector<int> B) {
    vector<vector<int>> ans(2 * N);

    vector<int> sus(2 * N); iota(all(sus), 1);
    for(int i = N; i < 2 * N; ++i)
        sus[i] = 1;

    for(int i = 0; i < N; ++i) {
        ans[2 * i] = vector<int>(2 * N, i + 1);
        ans[2 * i + 1] = sus;
    }

    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