Submission #5924

#	Time	Username	Problem	Language	Result	Execution time	Memory
5924		ainta	Board (CEOI13_board)	C++98	0 / 100	0 ms	18460 KiB

board

#include<stdio.h>
#include<algorithm>
#include<vector>
#define N_ 200010
#define INF 999999999
#define INFL 999999999999999999LL
using namespace std;
int n, w[N_], ed, par[N_], Path[N_], ord[N_], ord_c;
int Count[N_], top;
long long D[N_];
bool v[N_], res;
vector<int>E[N_];
long long Need[N_], Plus[N_];
struct B{
	int a;
	bool operator <(const B &p)const{
		return D[a]>D[p.a];
	}
}Heap[N_];
struct A{
	long long a, b;
	bool operator <(const A &p)const{
		return a < p.a;
	}
}TP[N_];
int main()
{
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10