Submission #831444

#TimeUsernameProblemLanguageResultExecution timeMemory
831444NeroZeinThousands Islands (IOI22_islands)C++17
5 / 100
424 ms66548 KiB
#include "islands.h" #include <variant> #include <vector> #include <bits/stdc++.h> using namespace std; std::variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) { if (N == 2) return false; map<pair<int, int>, int> mp; for (int i = 0; i < M; ++i) { mp[{U[i], V[i]}] = i; } vector<int> Path = {0, 1, 2, 0, 2, 1, 0, 2, 1, 0, 1, 2, 0}; vector<int> ret; //for (int rep = 1; rep <= 2; ++rep) { for (int i = 0; i < 6; ++i) { ret.push_back(mp[{Path[i], Path[i + 1]}]); } for (int i = 0; i < N; ++i) { for (int j = i + 1; j < N; ++j) { swap(mp[{i, j}], mp[{j, i}]); } } for (int i = 6; i < 12; ++i) { ret.push_back(mp[{Path[i], Path[i + 1]}]); } //} return ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...