169822025-05-19 20:42:28tomi7Háromszögeléscpp17Partially correct 0/10016ms576 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;i++){
        for(int j=i+1;j<n;j++){
            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;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
6Accepted1ms400 KiB
7Accepted2ms320 KiB
8Accepted2ms316 KiB
9Partially correct16ms556 KiB
10Partially correct14ms316 KiB
11Partially correct10ms316 KiB
12Partially correct14ms556 KiB
13Partially correct16ms556 KiB
14Partially correct12ms552 KiB
15Partially correct14ms556 KiB
16Wrong answer3ms564 KiB
17Partially correct16ms552 KiB
18Partially correct9ms548 KiB
19Partially correct3ms560 KiB
20Partially correct16ms576 KiB
21Partially correct14ms552 KiB
22Partially correct14ms552 KiB
23Partially correct10ms552 KiB
24Partially correct9ms552 KiB
25Partially correct9ms552 KiB
26Partially correct8ms556 KiB
27Partially correct9ms564 KiB
28Partially correct3ms316 KiB
29Partially correct3ms564 KiB
30Partially correct14ms556 KiB
31Partially correct4ms348 KiB
32Partially correct14ms560 KiB
33Partially correct8ms556 KiB
34Partially correct13ms548 KiB
35Partially correct14ms556 KiB
36Partially correct14ms560 KiB
37Partially correct14ms560 KiB
38Partially correct14ms552 KiB
39Partially correct14ms552 KiB
40Accepted2ms316 KiB