oj.uz

답안 #309715

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
309715 2020-10-04T11:20:07 Z lucaperju Vision Program (IOI19_vision) C++14
100 / 100
 46 ms 4340 KB 
#include "vision.h"
#include <bits/stdc++.h>
/*
#include <cstdio>
#include <cassert>
#include <string>
//#include "vision.h"

using namespace std;

static const int MAX_INSTRUCTIONS = 10000;
static const int MAX_INPUTS = 1000000;

static const int _AND = 0;
static const int _OR = 1;
static const int _XOR = 2;
static const int _NOT = 3;

static inline bool increasing(int a, int b, int c) {
	return a <= b && b <= c;
}

static inline void error(string message) {
	printf("%s\n", message.c_str());
	exit(0);
}

class InstructionNetwork {

	struct Instruction {
		int type;
		vector<int> input_indexes;

		inline Instruction(int _type, const vector<int>& _input_indexes):
				type(_type), input_indexes(_input_indexes) {
		}

		inline int apply(int a, int b) const {
			switch (type) {
				case _AND:
					return a & b;
				case _OR:
					return a | b;
				case _XOR:
					return a ^ b;
				default:
					return 0;
			}
		}

		inline int compute(const vector<int>& memory_cells) const {
			int r = memory_cells[input_indexes[0]];
			if (type == _NOT)
				return 1 - r;
			for (int j = 1; j < (int)input_indexes.size(); j++)
				r = apply(r, memory_cells[input_indexes[j]]);
			return r;
		}
	};

	int input_size;
	int total_inputs;
	vector<Instruction> instructions;

public:

	inline void init(int _input_size) {
		this->input_size = _input_size;
		this->total_inputs = 0;
		this->instructions.clear();
	}

	inline int add_instruction(int type, const vector<int>& input_indexes) {
		if (input_indexes.size() == 0)
			error("Instruction with no inputs");

		if (instructions.size() + 1 > MAX_INSTRUCTIONS)
			error("Too many instructions");

		if (total_inputs + input_indexes.size() > MAX_INPUTS)
			error("Too many inputs");

		instructions.emplace_back(type, input_indexes);
		total_inputs += input_indexes.size();
		int new_index = input_size + (int)instructions.size() - 1;

		for (int input_index : input_indexes)
			if (!increasing(0, input_index, new_index-1))
				error("Invalid index");

		return new_index;
	}

	inline int compute(vector<int> &memory_cells) const {
		for (auto &instruction : instructions)
			memory_cells.push_back(instruction.compute(memory_cells));
		return memory_cells.back();
	}
};


static InstructionNetwork instructionNetwork;


int add_and(vector<int> Ns) {
	return instructionNetwork.add_instruction(_AND, Ns);
}

int add_or(vector<int> Ns) {
	return instructionNetwork.add_instruction(_OR, Ns);
}

int add_xor(vector<int> Ns) {
	return instructionNetwork.add_instruction(_XOR, Ns);
}

int add_not(int N) {
	vector<int> Ns = {N};
	return instructionNetwork.add_instruction(_NOT, Ns);
}
*/
/// --------------------------------------------------------------------------------

using namespace std;
int mat[203][203];
vector<int>cols;
vector<int>lins;
vector<int>vc;
int diflin[203],difcol[203];
/*int add_not(int N)
{
    return 1;
}
int add_and(vector<int> Ns)
{
    return 1;
}
int add_or(vector<int> Ns)
{
    return 1;
}
int add_xor(vector<int> Ns)
{
    return 1;
}*/
int solvelin (int dif)
{
    int i;
    if(dif<=1)
    {
        vc.clear();
        for(i=0;i<lins.size();++i)
            vc.push_back(lins[i]);
        if(dif==0)
            return add_xor(vc);
        return add_not(add_xor(vc));
    }
    vector<int>aux1;
    for(i=0;i<lins.size();++i)
        aux1.push_back(i%dif+1);
    vector<int>aux2;
    for(int exp=0;exp<=8;++exp)
    {
        vc.clear();
        for(i=0;i<lins.size();++i)
            if(aux1[i]&(1<<exp))
                vc.push_back(lins[i]);
        if(vc.size()==0)
            break;
        aux2.push_back(add_xor(vc));
    }
    return add_not(add_or(aux2));
}
int solvecol (int dif)
{
    int i;
    if(dif<=1)
    {
        vc.clear();
        for(i=0;i<cols.size();++i)
            vc.push_back(cols[i]);
        if(dif==0)
            return add_xor(vc);
        return add_not(add_xor(vc));
    }
    vector<int>aux1;
    for(i=0;i<cols.size();++i)
        aux1.push_back(i%dif+1);
    vector<int>aux2;
    for(int exp=0;exp<=8;++exp)
    {
        vc.clear();
        for(i=0;i<cols.size();++i)
            if(aux1[i]&(1<<exp))
                vc.push_back(cols[i]);
        if(vc.size()==0)
            break;
        aux2.push_back(add_xor(vc));
    }
    return add_not(add_or(aux2));
}
void construct_network(int n, int m, int K) {
	/**
	std::vector<int> Ns;
	Ns = {0, 1};
	int a = add_and(Ns);
	Ns = {0, a};
	int b = add_or(Ns);
	Ns = {0, 1, b};
	int c = add_xor(Ns);
	add_not(c);
    */
    int i,j,k=0;
    for(i=1;i<=n;++i)
        for(j=1;j<=m;++j)
            mat[i][j]=k++;
    for(i=1;i<=n;++i)
    {
        vc.clear();
        for(j=1;j<=m;++j)
            vc.push_back(mat[i][j]);
        lins.push_back(add_or(vc));
    }
    for(j=1;j<=m;++j)
    {
        vc.clear();
        for(i=1;i<=n;++i)
            vc.push_back(mat[i][j]);
        cols.push_back(add_or(vc));
    }
    for(i=0;i<n;++i)
        diflin[i]=solvelin(i);
    for(j=0;j<m;++j)
        difcol[j]=solvecol(j);
    vector<int>aux;
    for(i=0;i<=min(n-1,K);++i)
    {
        if(K-i>=m)
            continue;
        vc.clear();
        j=K-i;
        for(k=i+1;k<n;++k)
            vc.push_back(diflin[k]);
        for(k=j+1;k<m;++k)
            vc.push_back(difcol[k]);
        if(vc.size())
        {
            int pzc=add_not(add_or(vc));
            vc.clear();
            vc.push_back(pzc);
            vc.push_back(diflin[i]);
            vc.push_back(difcol[j]);
            aux.push_back(add_and(vc));
        }
        else
        {
            vc.push_back(diflin[i]);
            vc.push_back(difcol[j]);
            aux.push_back(add_and(vc));
        }
    }
    add_or(aux);
}
/*

int main() {
	int H, W, K;
	assert(3 == scanf("%d%d%d", &H, &W, &K));

	FILE *log_file = fopen("log.txt","w");

	instructionNetwork.init(H * W);
	construct_network(H, W, K);

	while (true) {
		int rowA, colA, rowB, colB;
		assert(1 == scanf("%d", &rowA));
		if (rowA == -1)
			break;
		assert(3 == scanf("%d%d%d", &colA, &rowB, &colB));

		if ((!increasing(0, rowA, H-1)) ||
			(!increasing(0, colA, W-1)) ||
			(!increasing(0, rowB, H-1)) ||
			(!increasing(0, colB, W-1)) ||
			(rowA == rowB && colA == colB)) {
			printf("-1\n");
			fprintf(log_file, "-1\n");
			fflush(stdout);
			fflush(log_file);
			continue;
		}

		vector<int> memory_cells;
		for (int row = 0; row < H; row++)
			for (int col = 0; col < W; col++) {
				bool active = (row == rowA && col == colA) || (row == rowB && col == colB);
				memory_cells.push_back(active ? 1 : 0);
			}
		int computation_result = instructionNetwork.compute(memory_cells);

		printf("%d\n", computation_result);
		fflush(stdout);

		for(int i = 0; i < (int)memory_cells.size(); i++)
			fprintf(log_file, (i ? " %d" : "%d"), memory_cells[i]);
		fprintf(log_file, "\n");
		fflush(log_file);
	}
	fclose(stdin);
}
*/

Compilation message

vision.cpp: In function 'int solvelin(int)':
vision.cpp:152:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  152 |         for(i=0;i<lins.size();++i)
      |                 ~^~~~~~~~~~~~
vision.cpp:159:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  159 |     for(i=0;i<lins.size();++i)
      |             ~^~~~~~~~~~~~
vision.cpp:165:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  165 |         for(i=0;i<lins.size();++i)
      |                 ~^~~~~~~~~~~~
vision.cpp: In function 'int solvecol(int)':
vision.cpp:180:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  180 |         for(i=0;i<cols.size();++i)
      |                 ~^~~~~~~~~~~~
vision.cpp:187:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  187 |     for(i=0;i<cols.size();++i)
      |             ~^~~~~~~~~~~~
vision.cpp:193:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  193 |         for(i=0;i<cols.size();++i)
      |                 ~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 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 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 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 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 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 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 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 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 10 ms 1280 KB Output is correct
39 Correct 4 ms 512 KB Output is correct
40 Correct 4 ms 640 KB Output is correct
41 Correct 6 ms 896 KB Output is correct
42 Correct 6 ms 768 KB Output is correct
43 Correct 10 ms 1152 KB Output is correct
44 Correct 11 ms 1280 KB Output is correct
45 Correct 11 ms 1280 KB Output is correct
46 Correct 10 ms 1280 KB Output is correct
47 Correct 10 ms 1152 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 1408 KB Output is correct
2 Correct 15 ms 1408 KB Output is correct
3 Correct 14 ms 1408 KB Output is correct
4 Correct 15 ms 1408 KB Output is correct
5 Correct 14 ms 1536 KB Output is correct
6 Correct 15 ms 1536 KB Output is correct
7 Correct 15 ms 1496 KB Output is correct
8 Correct 15 ms 1536 KB Output is correct
9 Correct 15 ms 1408 KB Output is correct
10 Correct 15 ms 1408 KB Output is correct
11 Correct 15 ms 1408 KB Output is correct
12 Correct 15 ms 1408 KB Output is correct
13 Correct 15 ms 1408 KB Output is correct
14 Correct 15 ms 1408 KB Output is correct
15 Correct 15 ms 1536 KB Output is correct
16 Correct 15 ms 1536 KB Output is correct
17 Correct 15 ms 1536 KB Output is correct
18 Correct 15 ms 1536 KB Output is correct
19 Correct 15 ms 1536 KB Output is correct
20 Correct 15 ms 1536 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 5 ms 768 KB Output is correct
4 Correct 5 ms 768 KB Output is correct
5 Correct 5 ms 768 KB Output is correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 5 ms 768 KB Output is correct
8 Correct 9 ms 1024 KB Output is correct
9 Correct 9 ms 1152 KB Output is correct
10 Correct 9 ms 1152 KB Output is correct
11 Correct 9 ms 1024 KB Output is correct
12 Correct 9 ms 1024 KB Output is correct
13 Correct 15 ms 1408 KB Output is correct
14 Correct 15 ms 1408 KB Output is correct
15 Correct 15 ms 1408 KB Output is correct
16 Correct 15 ms 1408 KB Output is correct
17 Correct 17 ms 1536 KB Output is correct
18 Correct 15 ms 1484 KB Output is correct
19 Correct 14 ms 1536 KB Output is correct
20 Correct 29 ms 2424 KB Output is correct
21 Correct 26 ms 2680 KB Output is correct
22 Correct 25 ms 2680 KB Output is correct
23 Correct 23 ms 2432 KB Output is correct
24 Correct 23 ms 2424 KB Output is correct
25 Correct 25 ms 2560 KB Output is correct
26 Correct 24 ms 2432 KB Output is correct
27 Correct 40 ms 3968 KB Output is correct
28 Correct 42 ms 4212 KB Output is correct
29 Correct 44 ms 4340 KB Output is correct
30 Correct 40 ms 4084 KB Output is correct
31 Correct 39 ms 3828 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 3832 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 5 ms 768 KB Output is correct
4 Correct 9 ms 1024 KB Output is correct
5 Correct 14 ms 1408 KB Output is correct
6 Correct 15 ms 1536 KB Output is correct
7 Correct 24 ms 2432 KB Output is correct
8 Correct 24 ms 2560 KB Output is correct
9 Correct 41 ms 3844 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 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 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 10 ms 1280 KB Output is correct
39 Correct 4 ms 512 KB Output is correct
40 Correct 4 ms 640 KB Output is correct
41 Correct 6 ms 896 KB Output is correct
42 Correct 6 ms 768 KB Output is correct
43 Correct 10 ms 1152 KB Output is correct
44 Correct 11 ms 1280 KB Output is correct
45 Correct 11 ms 1280 KB Output is correct
46 Correct 10 ms 1280 KB Output is correct
47 Correct 10 ms 1152 KB Output is correct
48 Correct 15 ms 1408 KB Output is correct
49 Correct 15 ms 1408 KB Output is correct
50 Correct 14 ms 1408 KB Output is correct
51 Correct 15 ms 1408 KB Output is correct
52 Correct 14 ms 1536 KB Output is correct
53 Correct 15 ms 1536 KB Output is correct
54 Correct 15 ms 1496 KB Output is correct
55 Correct 15 ms 1536 KB Output is correct
56 Correct 15 ms 1408 KB Output is correct
57 Correct 15 ms 1408 KB Output is correct
58 Correct 15 ms 1408 KB Output is correct
59 Correct 15 ms 1408 KB Output is correct
60 Correct 15 ms 1408 KB Output is correct
61 Correct 15 ms 1408 KB Output is correct
62 Correct 15 ms 1536 KB Output is correct
63 Correct 15 ms 1536 KB Output is correct
64 Correct 15 ms 1536 KB Output is correct
65 Correct 15 ms 1536 KB Output is correct
66 Correct 15 ms 1536 KB Output is correct
67 Correct 15 ms 1536 KB Output is correct
68 Correct 1 ms 256 KB Output is correct
69 Correct 1 ms 256 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Correct 1 ms 256 KB Output is correct
72 Correct 5 ms 768 KB Output is correct
73 Correct 5 ms 768 KB Output is correct
74 Correct 5 ms 768 KB Output is correct
75 Correct 5 ms 768 KB Output is correct
76 Correct 5 ms 768 KB Output is correct
77 Correct 9 ms 1024 KB Output is correct
78 Correct 9 ms 1152 KB Output is correct
79 Correct 9 ms 1152 KB Output is correct
80 Correct 9 ms 1024 KB Output is correct
81 Correct 9 ms 1024 KB Output is correct
82 Correct 15 ms 1408 KB Output is correct
83 Correct 15 ms 1408 KB Output is correct
84 Correct 15 ms 1408 KB Output is correct
85 Correct 15 ms 1408 KB Output is correct
86 Correct 17 ms 1536 KB Output is correct
87 Correct 15 ms 1484 KB Output is correct
88 Correct 14 ms 1536 KB Output is correct
89 Correct 29 ms 2424 KB Output is correct
90 Correct 26 ms 2680 KB Output is correct
91 Correct 25 ms 2680 KB Output is correct
92 Correct 23 ms 2432 KB Output is correct
93 Correct 23 ms 2424 KB Output is correct
94 Correct 25 ms 2560 KB Output is correct
95 Correct 24 ms 2432 KB Output is correct
96 Correct 40 ms 3968 KB Output is correct
97 Correct 42 ms 4212 KB Output is correct
98 Correct 44 ms 4340 KB Output is correct
99 Correct 40 ms 4084 KB Output is correct
100 Correct 39 ms 3828 KB Output is correct
101 Correct 1 ms 256 KB Output is correct
102 Correct 0 ms 256 KB Output is correct
103 Correct 39 ms 3832 KB Output is correct
104 Correct 1 ms 256 KB Output is correct
105 Correct 5 ms 768 KB Output is correct
106 Correct 9 ms 1024 KB Output is correct
107 Correct 14 ms 1408 KB Output is correct
108 Correct 15 ms 1536 KB Output is correct
109 Correct 24 ms 2432 KB Output is correct
110 Correct 24 ms 2560 KB Output is correct
111 Correct 41 ms 3844 KB Output is correct
112 Correct 1 ms 256 KB Output is correct
113 Correct 0 ms 256 KB Output is correct
114 Correct 42 ms 4244 KB Output is correct
115 Correct 15 ms 1408 KB Output is correct
116 Correct 17 ms 1536 KB Output is correct
117 Correct 24 ms 2552 KB Output is correct
118 Correct 25 ms 2560 KB Output is correct
119 Correct 43 ms 4208 KB Output is correct
120 Correct 43 ms 4340 KB Output is correct
121 Correct 46 ms 4340 KB Output is correct
122 Correct 43 ms 4212 KB Output is correct
123 Correct 39 ms 3836 KB Output is correct
124 Correct 43 ms 4212 KB Output is correct
125 Correct 46 ms 4340 KB Output is correct
126 Correct 43 ms 4340 KB Output is correct
127 Correct 40 ms 3956 KB Output is correct
128 Correct 39 ms 3832 KB Output is correct