171482025-05-26 18:18:16tomi7Háromszögeléscpp11Wrong answer 0/1002ms556 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
6Accepted1ms332 KiB
7Accepted1ms316 KiB
8Wrong answer2ms556 KiB
9Wrong answer2ms316 KiB
10Wrong answer2ms328 KiB
11Accepted2ms316 KiB
12Accepted2ms316 KiB
13Wrong answer2ms328 KiB
14Accepted2ms316 KiB
15Accepted1ms316 KiB
16Accepted2ms316 KiB
17Accepted2ms512 KiB
18Accepted1ms316 KiB
19Accepted1ms316 KiB
20Accepted1ms316 KiB
21Accepted2ms316 KiB
22Accepted2ms316 KiB
23Accepted1ms316 KiB
24Accepted2ms316 KiB
25Accepted1ms316 KiB
26Accepted2ms316 KiB
27Accepted1ms316 KiB
28Accepted2ms316 KiB
29Accepted2ms316 KiB
30Wrong answer1ms316 KiB
31Accepted2ms504 KiB
32Accepted1ms508 KiB
33Accepted1ms316 KiB
34Accepted1ms316 KiB
35Wrong answer2ms316 KiB
36Accepted1ms316 KiB
37Wrong answer2ms316 KiB
38Accepted2ms512 KiB
39Accepted2ms316 KiB
40Accepted1ms316 KiB