oj.uz

Submission #297120

# Submission time Handle Problem Language Result Execution time Memory
297120 2020-09-11T09:21:16 Z Muhammetali Ancient Books (IOI17_books) C++11
12 / 100
 1 ms 384 KB 
#include "books.h"
#include <bits/stdc++.h>
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
ll minimum_walk(vector<int> p, int s)
{
	if (p[0]==0)
	{
		if (p[1]==1)
		{
			if (p[2]==2 && p[3]==3)return 0;
			if (p[2]==3 && p[3]==2)return 6;
			return 0;
		}
		if (p[1]==2)
		{
			if (p[2]==1 && p[3]==3)return 4;
			if (p[2]==3 && p[3]==1)return 6;
			return 4;
		}
		if (p[1]==3)
		{
			if (p[2]==1 && p[3]==2)return 6;
			if (p[2]==2 && p[3]==1)return 6;
		}
		return 0;
	}
	if (p[0]==1)
	{
		if (p[1]==0)
		{
			if (p[2]==2 && p[3]==3)return 2;
			if (p[2]==3 && p[3]==2)return 6;
			return 2;
		}
		if (p[1]==2)
		{
			if (p[2]==3 && p[3]==0)return 6;
			if (p[2]==0 && p[3]==3)return 4;
			return 4;
		}
		if (p[1]==3)
		{
			if (p[2]==2 && p[3]==0)return 6;
			if (p[2]==0 && p[3]==2)return 6;
		}
	}
	if (p[0]==2)
	{
		if (p[1]==0)
		{
			if (p[2]==1 && p[3]==3)return 4;
			if (p[2]==3 && p[3]==1)return 6;
			return 4;
		}
		if (p[1]==1)
		{
			if (p[2]==3 && p[3]==0)return 6;
			if (p[2]==0 && p[3]==3)return 4;
			return 4;
		}
		if (p[1]==3)
		{
			if (p[2]==1 && p[3]==0)return 8;
			if (p[2]==0 && p[3]==1)return 8;
		}
	}
	if (p[0]==3)
	{
		if (p[1]==2)
		{
			if (p[2]==1 && p[3]==0)return 8;
			if (p[2]==0 && p[3]==1)return 8;
		}
		if (p[1]==1)
		{
			if (p[2]==0 && p[3]==2)return 6;
			if (p[2]==2 && p[3]==0)return 6;
		}
		if (p[1]==0)
		{
			if (p[2]==1 && p[3]==2)return 6;
			if (p[2]==2 && p[3]==1)return 6;
		}
	}
}

Compilation message

books.cpp: In function 'll minimum_walk(std::vector<int>, int)':
books.cpp:107:1: warning: control reaches end of non-void function [-Wreturn-type]
  107 | }
      | ^

Subtask #1
12.0 / 12.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Incorrect 1 ms 256 KB 3rd lines differ - on the 1st token, expected: '338572', found: '6'
20 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Incorrect 1 ms 256 KB 3rd lines differ - on the 1st token, expected: '338572', found: '6'
20 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB 3rd lines differ - on the 1st token, expected: '3304', found: '4'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Incorrect 1 ms 256 KB 3rd lines differ - on the 1st token, expected: '338572', found: '6'
20 Halted 0 ms 0 KB -