Submission #3120240

Source Code Expand

Copy
```// #define DEBUG

/* ---------- STL Libraries ---------- */

// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>

// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>

// container library
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>

/* ---------- Namespace ---------- */

using namespace std;

/* ---------- Type Abbreviation ---------- */

template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
template <typename T>
using PQ = priority_queue<T>;
template <typename T>
using GPQ = priority_queue<T, vector<T>, greater<T>>;

using ll = long long;

#define fst first
#define snd second
#define pb push_back
#define mp make_pair
#define mt make_tuple

/* ---------- conversion ---------- */

#define INT(c) static_cast<int>(c)
#define CHAR(n) static_cast<char>(n)
#define LL(n) static_cast<ll>(n)
#define DOUBLE(n) static_cast<double>(n)

/* ---------- container ---------- */

#define ALL(v) (v).begin(), (v).end()
#define SIZE(v) (LL((v).size()))

#define FIND(v, k) (v).find(k) != (v).end()
#define VFIND(v, k) find(ALL(v), k) != (v).end()

#define gsort(b, e) sort(b, e, greater<decltype(*b)>())
#define SORT(v) sort(ALL(v))
#define GSORT(v) gsort(ALL(v))

/* ---------- repetition ---------- */

#define FOR(i, a, b) for (ll i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (ll i = (a); i >= (b); --i)

/* ----------- debug ---------- */

template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
os << "[";
for (auto vv : v)
os << vv << ",";
return os << "]";
}

template <class T>
ostream& operator<<(ostream& os, set<T> v) {
os << "[";
for (auto vv : v)
os << vv << ",";
return os << "]";
}

template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> p) {
return os << "(" << p.fst << "," << p.snd << ")";
}

/* ---------- Constants ---------- */

// const ll MOD = 1e9 + 7;
// const int INF = 1 << 25;
// const ll INF = 1LL << 50;
// const double PI = acos(-1);
// const double EPS = 1e-10;
// const ll dx[4] = {0, -1, 1, 0};
// const ll dy[4] = {-1, 0, 0, 1};

/* ---------- Short Functions ---------- */

template <typename T>
T sq(T a) {
return a * a;
}

template <typename T>
T gcd(T a, T b) {
if (a > b) return gcd(b, a);
return a == 0 ? b : gcd(b % a, a);
}

template <typename T, typename U>
T mypow(T b, U n) {
if (n == 0) return 1;
if (n == 1) return b /* % MOD */;
if (n % 2 == 0) {
return mypow(sq(b) /* % MOD */, n / 2);
} else {
return mypow(b, n - 1) * b /* % MOD */;
}
}

ll pcnt(ll b) {
return __builtin_popcountll(b);
}

/* v-v-v-v-v-v-v-v-v Main Part v-v-v-v-v-v-v-v-v */

V<tuple<ll, ll, ll>> edge;

void solve() {
edge.clear();

ll L;
cin >> L;
--L;
FOR(i, 1, 13) {
edge.pb(mt(i, i + 1, 0));
}

ll buf = 0;

FOR(i, 1, 14) {
ll base = mypow(3, i - 1);
if (L < base * 2 - 1) {
L -= base - 1;
buf += base;
break;
}
edge.pb(mt(i, i + 1, base));

if (L < base * 3 - 1) {
L -= base * 2 - 1;
buf += base * 2;
break;
}
edge.pb(mt(i, i + 1, base * 2));
}

// [buf, buf + L)を作る
while (L > 0) {
FOR(i, 1, 14) {
if (L >= mypow(3, i)) continue;

ll base = mypow(3, i - 1);
if (L < base * 2) {
edge.pb(mt(i, 14, buf));
buf += base;
L -= base;
} else {
edge.pb(mt(i, 14, buf));
edge.pb(mt(i, 14, buf + base));
buf += base * 2;
L -= base * 2;
}
break;
}
}

cout << 14 << " " << SIZE(edge) << endl;
for (auto t : edge) {
ll from, to, cost;
tie(from, to, cost) = t;
cout << from << " " << to << " " << cost << endl;
}

return;
}

int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// cout << fixed << setprecision(10);

#ifdef DEBUG
freopen("input.txt", "r", stdin);
int num;
cin >> num;
FOR(_, 1, num) {
cout << "++++++++++++++++++++" << endl;
solve();
}
#else
solve();
#endif

return 0;
}
```

#### Submission Info

Submission Time 2018-09-01 22:40:26+0900 D - All Your Paths are Different Lengths Misteer C++14 (GCC 5.4.1) 700 4638 Byte AC 1 ms 256 KB

#### Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 s1.txt, s2.txt
All 700 / 700 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt 1 ms 256 KB
02.txt 1 ms 256 KB
03.txt 1 ms 256 KB
04.txt 1 ms 256 KB
05.txt 1 ms 256 KB
06.txt 1 ms 256 KB
07.txt 1 ms 256 KB
08.txt 1 ms 256 KB
09.txt 1 ms 256 KB
10.txt 1 ms 256 KB
11.txt 1 ms 256 KB
12.txt 1 ms 256 KB
13.txt 1 ms 256 KB
14.txt 1 ms 256 KB
15.txt 1 ms 256 KB
16.txt 1 ms 256 KB
17.txt 1 ms 256 KB
18.txt 1 ms 256 KB
19.txt 1 ms 256 KB
20.txt 1 ms 256 KB
s1.txt 1 ms 256 KB
s2.txt 1 ms 256 KB