CSES - Datatähti 2015 loppu

CSES - Datatähti 2015 loppu - Results

Submission details
Task:	Lukujono
Sender:	SampoH
Submission time:	2015-01-29 13:52:09 +0200
Language:	C++
Status:	READY
Result:	50

Feedback
group	verdict	score
#1	ACCEPTED	16
#2	ACCEPTED	34
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.06 s	1	details
#2	ACCEPTED	0.06 s	1	details
#3	ACCEPTED	0.06 s	1	details
#4	ACCEPTED	0.06 s	1	details
#5	ACCEPTED	0.06 s	1	details
#6	ACCEPTED	0.06 s	1	details
#7	ACCEPTED	0.06 s	1	details
#8	ACCEPTED	0.05 s	1	details
#9	ACCEPTED	0.08 s	2	details
#10	ACCEPTED	0.08 s	2	details
#11	ACCEPTED	0.07 s	2	details
#12	ACCEPTED	0.09 s	2	details
#13	ACCEPTED	0.06 s	2	details
#14	ACCEPTED	0.09 s	2	details
#15	ACCEPTED	0.07 s	2	details
#16	ACCEPTED	0.08 s	2	details
#17	TIME LIMIT EXCEEDED	--	3	details
#18	TIME LIMIT EXCEEDED	--	3	details
#19	TIME LIMIT EXCEEDED	--	3	details
#20	TIME LIMIT EXCEEDED	--	3	details
#21	TIME LIMIT EXCEEDED	--	3	details
#22	TIME LIMIT EXCEEDED	--	3	details
#23	TIME LIMIT EXCEEDED	--	3	details
#24	TIME LIMIT EXCEEDED	--	3	details

Code

#include <iostream>
#include <map>

using namespace std;

#define ll long long

map<ll,ll> cache;

ll uolevi(ll x) {
	if (x == 0) return 0;
	if (x == 1) return 1;
	ll s = 0;
	ll n = 0;
	ll v = 0;
	if (cache.find(x) != cache.end()) {
		ll s = cache.at(x);
		return s;
	}
	ll c = 0;
	ll l = 0;
	ll lv = 0;
	for (int i = 2; i <= x; i++) {
		n = x/i;
		if (l == n) {
			s+=lv;
			continue;
		}	
		l = n;
		if (n < 2) {
			c = (x-i)+1;
			break;
		}	
		if (cache.find(n) != cache.end()) {
			v = cache.at(n);
		} else {
			v = uolevi(n);
			cache[n] = v;
		}
		lv = v;
		s += v;
	}
	s += c;
	return s;
}
/*ll uolevi_naive(ll x) {
	if (x == 0) return 0;
	if (x == 1) return 1;
	ll s = 0;
	ll n = 0;
	ll v = 0;
	for (int i = 2; i <= x; i++) {
		n = x/i;
		v = uolevi_naive(n);
		s += v;
	}
	return s;
}
}*/
int main(int argc, char ** argv) {
	cin.sync_with_stdio(false);

	ll n;
	cin >> n;
	
	cout << uolevi(n) << "\n";
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`542` view save

correct output
`11942` view save

user output
`11942` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`929` view save

correct output
`29913` view save

user output
`29913` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`801` view save

correct output
`23460` view save

user output
`23460` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`935` view save

correct output
`30006` view save

user output
`30006` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`998` view save

correct output
`33766` view save

user output
`33766` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`942` view save

correct output
`30490` view save

user output
`30490` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`736` view save

correct output
`20285` view save

user output
`20285` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`930` view save

correct output
`29975` view save

user output
`29975` view save

Test 9

Group: 2

Verdict: ACCEPTED

input
`95404` view save

correct output
`90172356` view save

user output
`90172356` view save

Test 10

Group: 2

Verdict: ACCEPTED

input
`98060` view save

correct output
`94687572` view save

user output
`94687572` view save

Test 11

Group: 2

Verdict: ACCEPTED

input
`69495` view save

correct output
`52308390` view save

user output
`52308390` view save

Test 12

Group: 2

Verdict: ACCEPTED

input
`92197` view save

correct output
`85306979` view save

user output
`85306979` view save

Test 13

Group: 2

Verdict: ACCEPTED

input
`53418` view save

correct output
`32957881` view save

user output
`32957881` view save

Test 14

Group: 2

Verdict: ACCEPTED

input
`97377` view save

correct output
`93859995` view save

user output
`93859995` view save

Test 15

Group: 2

Verdict: ACCEPTED

input
`68065` view save

correct output
`50223001` view save

user output
`50223001` view save

Test 16

Group: 2

Verdict: ACCEPTED

input
`95463` view save

correct output
`90201672` view save

user output
`90201672` view save

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`74323456` view save

correct output
`8975396101231` view save

user output
(empty)

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`92132055` view save

correct output
`13006378374515` view save

user output
(empty)

Test 19

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`55135704` view save

correct output
`5354656932672` view save

user output
(empty)

Test 20

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`98613338` view save

correct output
`14631125716007` view save

user output
(empty)

Test 21

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`75558302` view save

correct output
`9238208186405` view save

user output
(empty)

Test 22

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`94968034` view save

correct output
`13713914468591` view save

user output
(empty)

Test 23

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`52163652` view save

correct output
`4858985762438` view save

user output
(empty)

Test 24

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`94830583` view save

correct output
`13674294022172` view save

user output
(empty)

Datatähti 2015 loppu

Lukujono

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

Tasks

Submissions (SampoH)