oj.uz

Submission #321319

# Submission time Handle Problem Language Result Execution time Memory
321319 2020-11-12T05:41:48 Z seedkin Get Hundred Points! (FXCUP4_hundred) C++17
0 / 100
 1 ms 632 KB 
#include "hundred.h"
#include <stdio.h>
 
#define aBit 1
#define bBit 2
#define cBit 4
 
#define aIdx 0
#define bIdx 1
#define cIdx 2
 
int dir[100][8][100];   // dir[idx][char bit][target idx] =  char bit
 
std::string GetHundredPoints(int A, int B, int C) {
	// int a, b, c;
	// a = b = c = 0;
	int isCorret[100];
	int candi[100];
	// char ans[100];
	int bit[500];
	bit['A'] = aBit;
	bit['B'] = bBit;
	bit['C'] = cBit;
	// char c[5];
	// c[aBit] = 'A';
	// c[bBit] = 'B';
	// c[cBit] = 'C';
	
	std::string str = std::string(A, 'A') + std::string(B, 'B') + std::string(C, 'C');
	for(int i =0; i < 100 ; i++) {
		isCorret[i] = 0;
		// ans[i] = 'A';
		candi[i] = aBit | bBit | cBit;		
	}
	for(int i =0; i< 100; i++) {
		for(int j =0;j < 8; j++) {
			for(int k =0; k < 100; k++) {
				dir[i][j][k] = -1;
			}
		}
	}
	int result = Mark(str);
	if(result == A+B+C) return str;
	int prevResult = result;
 
	for(int i = 0; i < A+B+C; i++) {
		if(isCorret[i]) continue;
		for(int j =i+1; j < A+B+C; j++) {
			if(candi[i] == aBit || candi[i] == bBit || candi[i] == cBit) break;;
			if(isCorret[j]) continue;
			if(str[i] == str[j]) continue;
			if((candi[i] & bit[str[j]]) == 0) continue;
			if((candi[j] & bit[str[i]]) == 0) continue;
			char temp = str[i];
			str[i] = str[j];
			str[j] = temp;
 
			result = Mark(str);
			if(result == A+B+C) return str;
			int r = result - prevResult;
            if(r ==0) {
				temp = str[i];
				str[i] = str[j];
				str[j] = temp;
				dir[i][bit['A']][j] = bit['A'];
				dir[i][bit['B']][j] = bit['B'];
				dir[i][bit['C']][j] = bit['C'];
				continue;
			}
			else if(r == 1) {
				prevResult = result;
				candi[i] &= ~bit[str[j]];
				candi[j] &= ~bit[str[i]];
				dir[i][bit[str[i]]][j] = candi[i] & (~bit[str[i]]);
				dir[i][(candi[i] & (~bit[str[i]]))][j] = bit[str[j]];
				continue;
			}
		}
 
		if(isCorret[i]) continue;
 
		for(int j = i+1; j < A+B+C; j++) {			
			
		}
	}
 
	return str;
}

Compilation message

hundred.cpp: In function 'std::string GetHundredPoints(int, int, int)':
hundred.cpp:52:29: warning: array subscript has type 'char' [-Wchar-subscripts]
   52 |    if((candi[i] & bit[str[j]]) == 0) continue;
      |                             ^
hundred.cpp:53:29: warning: array subscript has type 'char' [-Wchar-subscripts]
   53 |    if((candi[j] & bit[str[i]]) == 0) continue;
      |                             ^
hundred.cpp:72:28: warning: array subscript has type 'char' [-Wchar-subscripts]
   72 |     candi[i] &= ~bit[str[j]];
      |                            ^
hundred.cpp:73:28: warning: array subscript has type 'char' [-Wchar-subscripts]
   73 |     candi[j] &= ~bit[str[i]];
      |                            ^
hundred.cpp:74:22: warning: array subscript has type 'char' [-Wchar-subscripts]
   74 |     dir[i][bit[str[i]]][j] = candi[i] & (~bit[str[i]]);
      |                      ^
hundred.cpp:74:53: warning: array subscript has type 'char' [-Wchar-subscripts]
   74 |     dir[i][bit[str[i]]][j] = candi[i] & (~bit[str[i]]);
      |                                                     ^
hundred.cpp:75:36: warning: array subscript has type 'char' [-Wchar-subscripts]
   75 |     dir[i][(candi[i] & (~bit[str[i]]))][j] = bit[str[j]];
      |                                    ^
hundred.cpp:75:56: warning: array subscript has type 'char' [-Wchar-subscripts]
   75 |     dir[i][(candi[i] & (~bit[str[i]]))][j] = bit[str[j]];
      |                                                        ^

Subtask #1
0 / 33.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 632 KB Execution killed with signal 13 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 67.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 632 KB Execution killed with signal 13 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -