Trailer song of the cartoon.

Don't let the problems affect on loving BAKAR :)

Good to see that the problems are un-googlable. But I found the scoreboard already :D

Well, the problems are expected to be reasonably easy, since it's quite a local-level contest. It's that way most of the time in these trainings, and it's usually solved by adding hard CodeJam problems...

I got WA1 3 times because I printed space at the end of line >(

Basis of an editorial: here

More to be added eventually.

Can we get data set of today contest?

I'm getting "judgement failed", what about this?

how can i see the testcases? atleast the one i failed or i carnt?

#include<algorithm>
#include<vector>
#include<iostream>
#include<cstdio>
#include<stdio.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define REP(i,n) for(i=0;i < n;i++)
#define pll pair<long long, long long>
#define DEBUG 0
typedef long long ll;
using namespace std;
const long maxn = 100000, maxm = 100000;
const long long  maxv = 100000000;
long n, m;
long ii, t;
struct sEdge {
	int a, b, w;
	bool operator<(const sEdge &A) const {
		return w < A.w;
    }
};
vector< sEdge > edges;
ll pre[2*maxn+3], sum[2*maxn+3], valueArr[2*maxn+3], root[2*maxn+3];
long solve(){
    long i;
    long nPart = n, nsize = n;
    REP(i,2*n)  pre[i] = -1, sum[i] = -maxv, root[i] = -1;
    for(int it = 0; it < edges.size(); it++){
        long u,v,w;
        u = edges[it].a;
        v = edges[it].b;
        w = edges[it].w;
        vector<long> fauv;
        while (root[u] >= 0){
            fauv.pb(u);
            u = root[u];
        }
        while (root[v] >= 0){
            fauv.pb(v);
            v = root[v];
        }
        if (u == v) continue;
        nPart--;
        valueArr[u] = -pre[v]*w;
        valueArr[v] = -pre[u]*w;
        valueArr[nsize]  = 0;
        pre[nsize] = pre[u]+pre[v];
        pre[u] = nsize;
        pre[v] = nsize;
        while (!fauv.empty()){
            root[fauv[0]]=nsize;
            fauv.erase(fauv.begin());
        }
        root[v] = nsize;
        root[u] = nsize;
        nsize++;
        if (nPart == 1) {
            sum[nsize-1] = 0;
            break;
        }
    }
    REP(i,n){
        if (sum[i] != -maxv) continue;
        vector<long> trade;
        long u = i;
        while (sum[u] == -maxv){
            trade.insert(trade.begin(),u);
            u = pre[u];
        }
        long j;
        for (j=0;j < trade.size();j++)
            sum[trade[j]]=sum[pre[trade[j]]]+valueArr[trade[j]];
    }
    cout << "Case " << ii+1 << ":" << endl;
    REP(i,n)
        if ((ii == t-1)&&(i==n-1))
            cout << sum[i];
        else
            cout << sum[i] << endl;
    return 1;
}
int main(){
    freopen("road.in","r",stdin);
    scanf("%d",&t);
    REP(ii,t){
        scanf("%d%d", &n, &m);
        long i;
        edges.clear();
        REP(i,m){
            sEdge u;
            scanf("%d%d%d", &u.a, &u.b, &u.w);
            u.a--; u.b--;
            edges.pb(u);
        }
        sort(all(edges));
        solve();
    }
    return 1;
}

Why do my code get Runtime error on test 1? Plzz help me out!!! (Ps: I did run Xellos's code and got the result)