171492025-05-26 18:18:43tomi7Háromszögeléscpp17Wrong answer 0/1002ms596 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;
    bool c=false;
    bool b=false;
    int x, y;
    for(int i=2;i<=n/2;i++){
        if(query(0, i)){
            x=i;
            b=true;
        }
        if(query(0, n-i)){
            y=n-i;
            c=true;
        }
    }
    if(!b && !c){
        return 1*n+n-1;
    }
    if(b && !c){
        return x*n+n-1;
    }
    if(c && !b){
        return y*n+1;
    }
    if(x==y){
        return x*n;
    }
    if(abs(x-y)==1){
        return x;
    }
    return x*n+y;
}
SubtaskSumTestVerdictTimeMemory
subtask10/100
1Accepted1ms316 KiB
2Accepted1ms316 KiB
3Wrong answer1ms316 KiB
4Accepted1ms316 KiB
5Wrong answer1ms316 KiB
6Accepted1ms316 KiB
7Accepted2ms316 KiB
8Wrong answer1ms316 KiB
9Wrong answer2ms316 KiB
10Wrong answer2ms316 KiB
11Accepted1ms316 KiB
12Accepted2ms548 KiB
13Wrong answer2ms508 KiB
14Accepted2ms316 KiB
15Accepted2ms316 KiB
16Accepted1ms316 KiB
17Accepted2ms508 KiB
18Accepted1ms316 KiB
19Accepted2ms508 KiB
20Accepted1ms316 KiB
21Accepted2ms316 KiB
22Accepted1ms316 KiB
23Accepted2ms508 KiB
24Accepted1ms316 KiB
25Accepted2ms560 KiB
26Accepted2ms316 KiB
27Accepted2ms316 KiB
28Accepted2ms500 KiB
29Accepted2ms316 KiB
30Wrong answer2ms316 KiB
31Accepted2ms316 KiB
32Accepted1ms316 KiB
33Accepted2ms556 KiB
34Accepted2ms504 KiB
35Wrong answer2ms508 KiB
36Accepted1ms316 KiB
37Wrong answer2ms560 KiB
38Accepted2ms400 KiB
39Accepted2ms596 KiB
40Accepted2ms384 KiB