169862025-05-19 20:56:10tomi7Háromszögeléscpp17Partially correct 0/10017ms756 KiB
// Source: https://usaco.guide/general/io

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


int query(int x, int y);



int solve(int n){
    vector<array<int, 3>> a;
    for(int i=0;i<n-1;i++){
        for(int j=i+1;j<n;j++){
            if(abs(i-j)==1){
                continue;
            }
            if(i==0 && j==n-1){
                continue;
            }
            int value=max(i, n-j);
            if(i==0){
                value=max(j, n-j);
            }
            a.push_back({value, i, j});
        }
    }
    sort(a.begin(), a.end());
    for(int i=0;i<n*(n-3)/2-1;i++){
        if(query(a[i][1], a[i][2])){
            return a[i][1]*n+a[i][2];
        }
    }
    return n/2;
}
SubtaskSumTestVerdictTimeMemory
subtask10/100
1Partially correct1ms316 KiB
2Partially correct1ms316 KiB
3Partially correct1ms316 KiB
4Partially correct1ms316 KiB
5Accepted1ms316 KiB
6Accepted1ms316 KiB
7Accepted2ms316 KiB
8Accepted2ms556 KiB
9Partially correct16ms552 KiB
10Partially correct14ms552 KiB
11Partially correct12ms564 KiB
12Partially correct16ms756 KiB
13Partially correct14ms564 KiB
14Partially correct13ms548 KiB
15Partially correct17ms556 KiB
16Wrong answer3ms376 KiB
17Partially correct14ms552 KiB
18Partially correct9ms548 KiB
19Partially correct4ms556 KiB
20Partially correct16ms556 KiB
21Partially correct14ms556 KiB
22Partially correct16ms548 KiB
23Partially correct10ms556 KiB
24Partially correct9ms556 KiB
25Partially correct9ms552 KiB
26Partially correct8ms552 KiB
27Partially correct8ms552 KiB
28Partially correct3ms564 KiB
29Partially correct3ms564 KiB
30Partially correct14ms564 KiB
31Partially correct4ms316 KiB
32Partially correct16ms556 KiB
33Partially correct8ms548 KiB
34Partially correct14ms552 KiB
35Partially correct14ms656 KiB
36Partially correct14ms552 KiB
37Partially correct16ms560 KiB
38Partially correct14ms552 KiB
39Partially correct14ms316 KiB
40Accepted2ms316 KiB