oj.uz

Submission #66077

# Submission time Handle Problem Language Result Execution time Memory
66077 2018-08-09T13:37:33 Z khohko None (JOI16_dungeon2) C++17
69 / 100
 42 ms 3564 KB 
#include "dungeon2.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fr first
#define sc second
#define ARRS ((ll)(2e6+100))
#define MAX ((ll)(1e9+100))
#define MOD ((ll)(1e9+7))

//void Inspect(int R);
//void Answer(int D, int A);
//void Move(int I, int V);
//int NumberOfRoads();
//int LastRoad();
//int Color();
#define num NumberOfRoads
#define lst LastRoad
#define clr Color

stack<ll> g;
vector<pair<ll,ll> > v[400];
ll C=1;
ll pr[400];
ll nm[400];
void mvb(){
	ll t=g.top();
	g.pop();
	if(t>=0)Move(t,2);
}

ll n=0;

ll go(ll f){
	g.push(LastRoad());
	ll k=Color();
	//cout<<k<<" = "<<lst()<<endl;
	if(k==2){mvb(); return 0;}
	n++;
	ll x=n;
	pr[x]=lst();
	if(f)v[x].pb({f,lst()});
	ll m=num();
	nm[x]=m;
	for(int i=1; i<=m; i++){
		if(i==g.top())continue;
		//cout<<x<<" -> "<<i<<endl;
		Move(i,2);
		ll k=go(x);
		if(k)v[x].pb({k,i});
			//v[k].pb(x);
		//}
	}
	mvb();
	return x;
}

ll f[400][400];
ll dp[400][400];
ll pw[400];
ll pas[400];
ll cr;

ll gc(ll x){
	return (x/pw[cr])%3+1;
}

void dfs(ll x){
	for(auto y:v[x]){
		if(y.sc==pr[x])continue;
		Move(y.sc,gc(x));
		dfs(y.fr);
	}
	if(pr[x]>=0)
	Move(pr[x],gc(x));
}

void slv(ll x){
	for(auto y:v[x]){
		if(y.sc==pr[x])continue;
		Move(y.sc,clr());
		slv(y.fr);
	}
	for(int i=1; i<=num(); i++){
		Move(i,clr());
		f[x][i]+=(clr()-1)*pw[cr];
		Move(lst(),clr());
	}
	if(pr[x]>=0)
	Move(pr[x],clr());
}


void Inspect(int R) {
	go(0);
	pw[0]=1;
	for(int i=1; i<15; i++)pw[i]=pw[i-1]*3;
	for(cr=0; cr<7; cr++){
		dfs(1);
		slv(1);
	}

	for(int i=1; i<=n; i++)
		for(int j=1; j<=n; j++)
			dp[i][j]=MAX;

	for(int i=1; i<=n; i++)
		for(int j=1; j<=nm[i]; j++)
			dp[i][f[i][j]]=1;

	for(int k=1; k<=n; k++)
		for(int i=1; i<=n; i++)
			for(int j=1; j<=n; j++)
				dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]);

	for(int i=1; i<=n; i++)
		for(int j=i+1; j<=n; j++)
			pas[dp[i][j]]++;

	for(int i = 1; i <= R; i++)
		Answer(i, pas[i]);
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 764 KB Output is correct
2 Correct 4 ms 924 KB Output is correct
3 Correct 4 ms 924 KB Output is correct
4 Correct 4 ms 924 KB Output is correct
5 Correct 3 ms 924 KB Output is correct
6 Correct 3 ms 924 KB Output is correct
7 Correct 3 ms 984 KB Output is correct
8 Correct 4 ms 984 KB Output is correct
9 Correct 3 ms 984 KB Output is correct
10 Correct 4 ms 1064 KB Output is correct
11 Correct 4 ms 1064 KB Output is correct
12 Correct 4 ms 1088 KB Output is correct
13 Correct 4 ms 1088 KB Output is correct
14 Correct 4 ms 1088 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1088 KB Output is correct
2 Correct 4 ms 1088 KB Output is correct
3 Correct 3 ms 1088 KB Output is correct
4 Correct 3 ms 1088 KB Output is correct
5 Correct 3 ms 1088 KB Output is correct
6 Correct 4 ms 1088 KB Output is correct
7 Correct 3 ms 1088 KB Output is correct
8 Correct 4 ms 1088 KB Output is correct
9 Correct 3 ms 1088 KB Output is correct
10 Correct 3 ms 1088 KB Output is correct
11 Correct 3 ms 1088 KB Output is correct
12 Correct 4 ms 1088 KB Output is correct
13 Correct 3 ms 1088 KB Output is correct
14 Correct 3 ms 1088 KB Output is correct
15 Correct 3 ms 1088 KB Output is correct

Subtask #3
25.0 / 56.0

# Verdict Execution time Memory Grader output
1 Partially correct 15 ms 2300 KB Partially correct
2 Partially correct 16 ms 2300 KB Partially correct
3 Partially correct 21 ms 2308 KB Partially correct
4 Partially correct 42 ms 2792 KB Partially correct
5 Partially correct 5 ms 2792 KB Partially correct
6 Partially correct 7 ms 2792 KB Partially correct
7 Partially correct 18 ms 2792 KB Partially correct
8 Partially correct 18 ms 2792 KB Partially correct
9 Partially correct 17 ms 2792 KB Partially correct
10 Partially correct 16 ms 2792 KB Partially correct
11 Partially correct 16 ms 2888 KB Partially correct
12 Partially correct 20 ms 2912 KB Partially correct
13 Partially correct 19 ms 2912 KB Partially correct
14 Partially correct 23 ms 2912 KB Partially correct
15 Partially correct 17 ms 2912 KB Partially correct
16 Partially correct 9 ms 2912 KB Partially correct
17 Partially correct 39 ms 3160 KB Partially correct
18 Partially correct 35 ms 3408 KB Partially correct
19 Partially correct 39 ms 3564 KB Partially correct