Submission #585099

#	Time	Username	Problem	Language	Result	Execution time	Memory
585099		Jomnoi	Triangles (CEOI18_tri)	C++17	35 / 100	143 ms	472 KiB

tri

#include <bits/stdc++.h>
#include "trilib.h"
using namespace std;
 
const int MAX_N = 505;
 
bool mark[MAX_N][MAX_N];
 
int main() {
    int N = get_n();
 
    for(int i = 1; i <= N; i++) {
        for(int j = 1; j <= N; j++) {
            for(int k = 1; k <= N; k++) {
                if(i != j and k != i and k != j and mark[i][j] == false and is_clockwise(k, i, j) == true) {
                    mark[i][j] = true;
                }
            }
        }
    }
 
    set <int> s;
    for(int i = 1; i <= N; i++) {
        for(int j = 1; j <= N; j++) {
            if(i != j and mark[i][j] == false) {
                s.insert(i);
                s.insert(j);
            }
        }
    }
    give_answer(s.size());
    return 0;
}

• Subtask 1: 15 / 15
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 20 / 20
• Subtask 5: 0 / 25