Submission #519040

#	Time	Username	Problem	Language	Result	Execution time	Memory
519040		thegrimbee	Square or Rectangle? (NOI19_squarerect)	C++14	0 / 100	1 ms	292 KiB

squarerect

#include "squarerect.h"
#include <bits/stdc++.h>
using namespace std;

bool am_i_square(int N, int Q) {
	bool visited[100][100];
	int i, j, tempi, tempj;
	bool temp;
	for (i = 1; i <100; i += 20){
		for (j = 1; j < 100; j += 20){
			if (inside_shape(i, j)){tempi = i; tempj = j;j=101;i=101;}
		}
	} 
	i = tempi;
	j = tempj;
	int lo, hi, mid, len, len2;
	lo  = j - 19;
	hi = j;
	mid = (lo + hi)/ 2;
	if (lo > 0){
		while (lo != mid){
			temp = inside_shape(i, mid);
			visited[i-1][mid-1] = temp;
			if (temp)hi = mid;
			else lo = mid;
			mid = (lo + hi)/2;
		}
	}
	else{
		mid = j;
	}
	len = j - mid + (int)visited[i-1][mid-1];
	cout << len << '\n';
	lo = j + 19 - len;
	hi = 101;
	mid = (lo + hi)/2;
	while (lo != mid){
			temp = inside_shape(i, mid);
			visited[i-1][mid-1] = temp;
			if (!temp)hi = mid;
			else {lo = mid;if(mid - j + len > 101 - max(1, i - 20))return false;}
			mid = (lo + hi)/2;
		}
	len += mid - j + (int)visited[i-1][mid-1] - 1;
	cout << len << '\n';
	if (len < 20)return false;
	lo = max(1, i - 19);
	hi = i;
	mid = (lo + hi) / 2;
	temp = false;
	while (lo != mid){
		temp = inside_shape(mid, j);
		visited[mid-1][j-1] = temp;
		if (temp){hi = mid;if(101 - mid < len)return false;}
		else lo = mid;
		mid = (lo + hi)/2;
	}
	len2 = i - mid + (int)visited[mid-1][j-1];
	cout << len2 << '\n';
	temp = inside_shape(i + len-len2, j);
	if (!temp) return false;
	if (((i + len - len2 == 100) && temp) || (temp && !inside_shape(i + len-len2 + 1, j)))return true;
	return false;
}

Compilation message (stderr)

squarerect.cpp: In function 'bool am_i_square(int, int)':
squarerect.cpp:23:13: warning: 'tempi' may be used uninitialized in this function [-Wmaybe-uninitialized]
   23 |    visited[i-1][mid-1] = temp;
      |            ~^~
squarerect.cpp:32:10: warning: 'tempj' may be used uninitialized in this function [-Wmaybe-uninitialized]
   32 |  len = j - mid + (int)visited[i-1][mid-1];
      |        ~~^~~~~

• Subtask 1: 0 / 14
• Subtask 2: 0 / 19
• Subtask 3: 0 / 18
• Subtask 4: 0 / 49