Submission #3122131

Source Code Expand

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

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair


typedef pair<ii, int> Edge;

vector<ii> to3(int x) {
    vector<ii> res;
    for (int i=0; x>0; ++i) {
        res.pb(ii(i, x%3));
        x /= 3;
    }
    return res;
}
vi pow3;

vector<Edge> edges;


inline void add_edge(int u, int v, int w) {
    edges.push_back(Edge(ii(u, v), w));
}

void solve(int L) {
    pow3.clear();
    for (int i=0,p=1; p<=1000000; ++i,p*=3) pow3.pb(p);

    edges.clear();

    vector<ii> x = to3(L);
    reverse(ALL(x));
#ifdef DEBUG
    // cerr << L << " " << x << endl;
#endif

    int M = x.size();

    int last = 0;
    for (int node=0,w=1; node<M-1; ++node,w*=3) { // 12, 12*2
        rep(j, 3) {
            add_edge(node, node+1, w*j);
        }
        last = node+1;
    }
    assert(last == M-1);

    if (x[0].second == 1) --M;

    int ofs = 0;
    for (ii xi : x) {
        int i=xi.first, p=pow3[i], n=xi.second;
        if (n == 0) continue;
        if (ofs == 0 && n == 1) {
            ofs += p; continue;
        }
        for (int j=0; j<n; ++j) {
            add_edge(i, M, ofs + p*j);
        }
        ofs += p*n;
    }

    printf("%d %d\n", M+1, (int)edges.size());
    for (Edge e : edges){
        int u = e.first.first, v = e.first.second, w = e.second;
        printf("%d %d %d\n", 1+u, 1+v, w);
    }
}

int main() {
    int L; cin >> L;
    solve(L);
    return 0;
}

Submission Info

Submission Time
Task D - All Your Paths are Different Lengths
User naoya_t
Language C++14 (GCC 5.4.1)
Score 700
Code Size 2618 Byte
Status
Exec Time 1 ms
Memory 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