Euclidean Geometry

input/code.cpp: In function 'void solvaa()':
input/code.cpp:72:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < normals.size(); i++) {
                         ~~^~~~~~~~~~~~~~~~

#include <iostream>
#include <vector>
#include <cmath>
 
using namespace std;
 
 
bool image[100][100];
 
bool is_edge(int ox, int oy) {
    if (!image[ox][oy]) {
        return false;
    }
    
    for (int x = -1; x <= 1; x++) {
        for (int y = -1; y <= 1; y++) {
            if (!image[ox+x][oy+y]) { return true; }
        }
    }
    
    return false;
}
 
float normal(int ox, int oy) {
    
    float dx = 0;
    float dy = 0;
    
    for (int x = -3; x <= 3; x++) {
        for (int y = -3; y <= 3; y++) {
            if (x == 0 && y == 0) {continue;}
            if (image[ox+x][oy+y]) {
                float l = sqrt(x*x + y*y);
                if (l > 3) { continue; }
                float nx = x / l;
                float ny = y / l;
                dx += nx;
                dy += ny;
            }
        }
    }
    //cout << dy << ' ' << dx << endl;
    //cout << dy << ' ' << dx << ' ' << atan2(dy, dx) << endl;
    return atan2(dy, dx);
}
 
void solvaa() {
    for (int x = 0; x < 100; x++) {
        for (int y = 0; y < 100; y++) {
            char tmp;
            cin >> tmp;
            image[x][y] = ('1' == tmp);
        }
    }
    
    vector<float> normals;
    
    for (int x = 0; x < 100; x++) {
        for (int y = 0; y < 100; y++) {
            if (is_edge(x, y)) {
                normals.push_back(normal(x,y));
            }
        }
    }
    
    int sivut = 0;
    
    float pi = 3.141592;
 
    for (float dir = -pi; dir < pi; dir += 0.25) {
        int count = 0;
        for (int i = 0; i < normals.size(); i++) {
            if(abs(dir-normals[i]) < 0.25/2) { count++; }
        }
        
        if (count > 10) {
            sivut++;
        }
    }
    
    cout << sivut << endl;
}
 
int main() {
    int t;
    cin >> t;
    for (int i = 0; i < t; i++) {
        solvaa();
    }
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER