Submission #2897173
Source Code Expand
#include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <climits> #include <cfloat> #include <ctime> #include <cassert> #include <map> #include <utility> #include <set> #include <iostream> #include <memory> #include <string> #include <vector> #include <algorithm> #include <functional> #include <sstream> #include <complex> #include <stack> #include <queue> #include <numeric> #include <list> #include <iomanip> using namespace std; #if __GNUC__ #include <tr1/unordered_map> #include <tr1/unordered_set> using namespace tr1; #else #include <unordered_map> #include <unordered_set> #endif #ifdef __GNUC__ template <class T> int popcount(T n); template <> int popcount(unsigned int n) { return __builtin_popcount(n); } template <> int popcount(int n) { return __builtin_popcount(n); } template <> int popcount(unsigned long long n) { return __builtin_popcountll(n); } template <> int popcount(long long n) { return __builtin_popcountll(n); } #else #define __typeof__ decltype template <class T> int popcount(T n) { return n ? 1 + popcount(n & (n - 1)) : 0; } #endif #define rep(i, n) for (int i = 0; i < (int)n; ++i) #define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it) #define rforeach(it, c) for (__typeof__((c).rbegin()) it=(c).rbegin(); it != (c).rend(); ++it) #define all(c) (c).begin(), (c).end() #define rall(c) (c).rbegin(), (c).rend() #define CL(arr, val) memset(arr, val, sizeof(arr)) #define COPY(dest, src) memcpy(dest, src, sizeof(src)) template <class T> void max_swap(T& a, const T& b) { a = max(a, b); } template <class T> void min_swap(T& a, const T& b) { a = min(a, b); } typedef long long ll; typedef pair<int, int> pint; template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); } const double EPS = 1e-8; const double PI = acos(-1.0); const int dx[] = { 0, 1, 0, -1 }; const int dy[] = { 1, 0, -1, 0 }; bool valid_pos(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; } template <class T> void print(T a, int n, int br = 1, const string& deli = ", ") { cout << "{ "; for (int i = 0; i < n; ++i) { cout << a[i]; if (i + 1 != n) cout << deli; } cout << " }"; while (br--) cout << endl; } template <class T> void print(const vector<T>& v, int br = 1, const string& deli = ", ") { print(v, v.size(), br, deli); } template <class T> void print2d(T a, int w, int h, int width = -1, int br = 1) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) { if (width != -1) cout.width(width); cout << a[i][j] << ' '; } cout << endl; } while (br--) cout << endl; } template <class T> void input(int n, T& a) { for (int i = 0; i < n; ++i) cin >> a[i]; } template <class T, class U> void input(int n, T& a, U& b) { for (int i = 0; i < n; ++i) cin >> a[i] >> b[i]; } ll merge_count(vector<int>& a) { int n = a.size(); if(n <= 1) return 0; ll res = 0; vector<int> b(a.begin(), a.begin() + n / 2), c(a.begin() + n / 2, a.end()); res += merge_count(b); res += merge_count(c); int ai = 0, bi = 0, ci = 0; while (ai < n) { if (bi < b.size() && (ci == c.size() || b[bi] <= c[ci])) { a[ai++] = b[bi++]; } else { res += n / 2 - bi; a[ai++] = c[ci++]; } } return res; } ll bubble(const vector<int>& a) { vector<int> t(a); ll res = merge_count(t); return res; } vector<vector<int> > e; bool used[114514]; vector<int> order(int v) { vector<int> res; for (int i = v, prev = -1; i != -1; ) { res.push_back(i); used[i] = true; int next = -1; for (int j = 0; j < e[i].size(); ++j) if (e[i][j] != prev) next = e[i][j]; prev = i; i = next; } return res; } long long best_swap(int N, int M,int E[][2]) { e = vector<vector<int> >(N); for (int i = 0; i < M; ++i) { int a = E[i][0], b = E[i][1]; e[a].push_back(b); e[b].push_back(a); } for (int i = 0; i < N; ++i) { sort(all(e[i])); e[i].erase(unique(all(e[i])), e[i].end()); if (e[i].size() > 2) return -1; } ll res = 0; for (int i = 0; i < N; ++i) { if (!used[i]) { if (e[i].size() == 1) { vector<int> o = order(i); ll x = bubble(o); reverse(all(o)); ll y = bubble(o); res += min(x, y); } else if (e[i].size() == 0) used[i] = true; } } if (count(used, used + N, true) != N) return -1; return res; }
Submission Info
Submission Time | |
---|---|
Task | A - 国際道迷いオリンピック(International Michimayoi Olympic) |
User | I_love_you_Susan |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 4516 Byte |
Status | CE |
Compile Error
/usr/bin/ld: /usr/lib/debug/usr/lib/x86_64-linux-gnu/crt1.o(.debug_info): relocation 0 has invalid symbol index 11 /usr/bin/ld: /usr/lib/debug/usr/lib/x86_64-linux-gnu/crt1.o(.debug_info): relocation 1 has invalid symbol index 12 /usr/bin/ld: /usr/lib/debug/usr/lib/x86_64-linux-gnu/crt1.o(.debug_info): relocation 2 has invalid symbol index 2 /usr/bin/ld: /usr/lib/debug/usr/lib/x86_64-linux-gnu/crt1.o(.debug_info): relocation 3 has invalid symbol index 2 /usr/bin/ld: /usr/lib/debug/usr/lib/x86_64-linux-gnu/crt1.o(.debug_info): relocation 4 has invalid symbol index 11 /usr/bin/ld: /usr/lib/debug/usr/lib/x86_64-linux-gnu/crt1.o(.debug_info): relocation 5 has invalid symbol index 13 /usr/bin/ld: /usr/lib/debug/usr/lib/x86_64-linux-gnu/crt1.o(.debug_info): relocation 6 has invalid symbol index 13 /usr/bin/ld: /usr/lib/debug/usr/lib/x86_64-linux-gnu/crt1.o(.debug_info): relocation 7 has invalid symbol index 13 /usr/bin/ld: /usr/lib/debug/usr/lib/x86_64-linux-gnu/crt1.o(.debug_info): relocation 8 has invalid symbol ...