CSES - Datatähti 2023 alku

CSES - Datatähti 2023 alku - Results

Submission details
Task:	Sadonkorjuu
Sender:	Laserr
Submission time:	2022-11-11 17:59:39 +0200
Language:	C++ (C++11)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2	details
#2	ACCEPTED	0.00 s	1, 2	details
#3	ACCEPTED	0.00 s	1, 2	details
#4	ACCEPTED	0.00 s	1, 2	details
#5	ACCEPTED	0.00 s	1, 2	details
#6	WRONG ANSWER	0.01 s	1, 2	details
#7	WRONG ANSWER	0.34 s	2	details
#8	WRONG ANSWER	0.01 s	1, 2	details
#9	WRONG ANSWER	0.34 s	2	details
#10	WRONG ANSWER	0.01 s	1, 2	details
#11	WRONG ANSWER	0.34 s	2	details
#12	RUNTIME ERROR	0.78 s	2	details
#13	RUNTIME ERROR	0.79 s	2	details
#14	RUNTIME ERROR	0.77 s	2	details
#15	ACCEPTED	0.17 s	1, 2	details
#16	ACCEPTED	0.17 s	1, 2	details
#17	ACCEPTED	0.16 s	1, 2	details
#18	WRONG ANSWER	0.07 s	1, 2	details
#19	ACCEPTED	0.07 s	1, 2	details
#20	ACCEPTED	0.07 s	1, 2	details
#21	TIME LIMIT EXCEEDED	--	2	details
#22	TIME LIMIT EXCEEDED	--	2	details
#23	TIME LIMIT EXCEEDED	--	2	details
#24	ACCEPTED	0.07 s	1, 2	details
#25	TIME LIMIT EXCEEDED	--	2	details
#26	ACCEPTED	0.07 s	1, 2	details
#27	TIME LIMIT EXCEEDED	--	2	details
#28	ACCEPTED	0.07 s	1, 2	details
#29	TIME LIMIT EXCEEDED	--	2	details
#30	ACCEPTED	0.07 s	1, 2	details
#31	TIME LIMIT EXCEEDED	--	2	details

Compiler report

input/code.cpp: In function 'std::vector<kaupunki> haku(long long int, long long int, std::vector<kaupunki>)':
input/code.cpp:37:41: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |                 for (long long j = 0; j < vk[i].tiet.size(); j++) {
      |                                       ~~^~~~~~~~~~~~~~~~~~~

Code

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

struct kaupunki {
	long long onko_kaupunki, lk, yhteydet;
	vector<pair<long long, long long>> tiet;

	kaupunki(long long k) {
		onko_kaupunki = k;
		yhteydet = 0;
		if (onko_kaupunki == 0) lk = 0;
		else lk = -1;
	}
};

struct tie {
	long long a, b, c;
	tie(long long a_, long long b_, long long c_) {
		a = a_;
		b = b_;
		c = c_;
	}

	bool operator<(const tie& p) {
		if (p.a != a) return a < p.a;
		else return b < p.b;
	}
};

vector<kaupunki> haku(long long i, long long e, vector<kaupunki>vk) {
	if (e >= 0 && (e < vk[i].lk || vk[i].lk == -1)) vk[i].lk = e;

	if (vk[i].tiet.size() > 0) {
		for (long long j = 0; j < vk[i].tiet.size(); j++) {
			
			long long lahete = 0;
			if (vk[i].lk == -1) lahete = -1;
			else lahete = vk[i].tiet[j].second + vk[i].lk; 

			vk = haku(vk[i].tiet[j].first-1, lahete, vk);

			if ((vk[i].tiet[j].second + vk[vk[i].tiet[j].first - 1].lk < vk[i].lk || vk[i].lk == -1) && 0 <= vk[i].tiet[j].second + vk[vk[i].tiet[j].first - 1].lk) {
				vk[i].lk = vk[i].tiet[j].second + vk[vk[i].tiet[j].first - 1].lk;
			}

		}
	}
	//cout << i + 1 << " " << vk[i].lk << "\n";
	return vk;
}

vector<kaupunki> haku2(long long i, long long e, vector<kaupunki>vk) {
	if (e >= 0 && (e < vk[i].lk || vk[i].lk == -1)) vk[i].lk = e;

	if (vk[i].tiet.size() > 0) {
		for (long long j = vk[i].tiet.size() - 1; j >= 0; j--) {

			long long lahete = 0;
			if (vk[i].lk == -1) lahete = -1;
			else lahete = vk[i].tiet[j].second + vk[i].lk;

			vk = haku2(vk[i].tiet[j].first - 1, lahete, vk);

			if ((vk[i].tiet[j].second + vk[vk[i].tiet[j].first - 1].lk < vk[i].lk || vk[i].lk == -1) && 0 <= vk[i].tiet[j].second + vk[vk[i].tiet[j].first - 1].lk) {
				vk[i].lk = vk[i].tiet[j].second + vk[vk[i].tiet[j].first - 1].lk;
			}

		}
	}

	return vk;
}

int main() {
	long long n;
	cin >> n;

	long long vastaus = 0;
	vector<kaupunki> vk;
	vector<tie> vt;
	
	for (long long i = 0; i < n; i++) {
		long long t;
		cin >> t;
		vk.push_back(kaupunki(t));
	}
	for (long long i = 0; i < n - 1; i++) {
		long long a, b, c;
		cin >> a >> b >> c;
		vk[a - 1].yhteydet++;
		vk[b - 1].yhteydet++;
		vt.push_back(tie(a, b, c));
	}
	for (tie i : vt) {
		if (vk[i.a - 1].yhteydet < vk[i.b - 1].yhteydet)swap(i.a, i.b);
	}

	sort(vt.begin(), vt.end());
	for (long long i = 0; i < n - 1; i++) vk[vt[i].a - 1].tiet.push_back({ vt[i].b, vt[i].c });
	
	//cout << "\n";
	//for (tie i : vt)cout << i.a << " " << i.b << " " << i.c << "\n";

	vk = haku(0, -1, vk);
	vk = haku2(0, -1, vk);

	for (kaupunki i : vk) vastaus += i.lk;

	cout << vastaus;
}

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
`1 0` view save

correct output
`0` view save

user output
`0` view save

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 0 0 0 0 1 2 1 2 3 2 3 4 3 ...` view save

correct output
`0` view save

user output
`0` view save

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
`4 1 0 1 1 1 2 10 2 3 20 2 4 30` view save

correct output
`60` view save

user output
`60` view save

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 1 1 1 0 1 2 10 2 3 20 3 4 30 ...` view save

correct output
`80` view save

user output
`80` view save

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 1 0 1 1 1 2 1 2 3 5 3 4 3 ...` view save

correct output
`6` view save

user output
`6` view save

Test 6

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5506363` view save

user output
`1665` view save

Test 7

Group: 2

Verdict: WRONG ANSWER

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1795118520` view save

user output
`-199207` view save

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 0 0 1 0 1 1 0 1 0 1 1 0 0 0 1 ...` view save

correct output
`293576` view save

user output
`-500` view save

Test 9

Group: 2

Verdict: WRONG ANSWER

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`816932444` view save

user output
`-196836` view save

Test 10

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`3089` view save

user output
`-10` view save

Test 11

Group: 2

Verdict: WRONG ANSWER

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`40839` view save

user output
`-100` view save

Test 12

Group: 2

Verdict: RUNTIME ERROR

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5683983203973` view save

user output
(empty)

Test 13

Group: 2

Verdict: RUNTIME ERROR

input
`200000 0 1 1 1 1 1 1 0 0 0 1 1 0 1 0 ...` view save

correct output
`58572993` view save

user output
(empty)

Test 14

Group: 2

Verdict: RUNTIME ERROR

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`32755` view save

user output
(empty)

Test 15

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`126238345` view save

user output
`126238345` view save

Test 16

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 0 0 1 0 1 1 1 0 0 1 0 1 1 0 ...` view save

correct output
`278678` view save

user output
`278678` view save

Test 17

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 ...` view save

correct output
`34929` view save

user output
`34929` view save

Test 18

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1543963` view save

user output
`1537825` view save

Test 19

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`39606` view save

user output
`39606` view save

Test 20

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 0 1 0 1 0 0 0 0 1 1 0 0 0 1 ...` view save

correct output
`321598` view save

user output
`321598` view save

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`978670626` view save

user output
(empty)

Test 22

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`375218` view save

user output
(empty)

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 0 0 0 0 0 1 0 1 0 1 1 ...` view save

correct output
`60422556` view save

user output
(empty)

Test 24

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`291990` view save

user output
`291990` view save

Test 25

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`59607954` view save

user output
(empty)

Test 26

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`990` view save

user output
`990` view save

Test 27

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`199982` view save

user output
(empty)

Test 28

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`7987` view save

user output
`7987` view save

Test 29

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`3137875` view save

user output
(empty)

Test 30

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`4657693` view save

user output
`4657693` view save

Test 31

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1652889357` view save

user output
(empty)

Datatähti 2023 alku

Sadonkorjuu

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Tasks

Submissions (Laserr)