제출 #1249871

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1249871		Jakub_Wozniak	3개의 봉우리 (IOI25_triples)	C++20	7.43 / 100	14 ms	2376 KiB

triples

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<vector <int> ,ll> pvl;
#define st first
#define nd second


vector<int> construct_range(int M, int K)
{
    vector <int> res(M,0);
    int s = M/2;
    res[s] = 1;
    int licz = 1;
    for(int i = s-1 ; i >= 0 ; i-=2)
    {
        res[i] = licz+1;
        if(i-1 >= 0)res[i-1] = licz; 
        licz += 2;
    }
    licz = 1;
    for(int i = s+1 ; i < M ; i+=2)
    {
        res[i] = licz+1;
        if(i < M)res[i+1] = licz; 
        licz += 2;
    }

    return res;
}

long long count_triples(std::vector<int> H)
{
    return 0;
}



/*
int main()
{
    int M , K;
    cin >> M >> K;
    vector <int> r;
    r = construct_range(M,K);
    for(auto p : r)cout << p << ' ';
    cout << '\n';
    return 0;
}*/

• Subtask 0: 0 / 0
• Subtask 1: 0 / 8
• Subtask 2: 0 / 6
• Subtask 3: 0 / 10
• Subtask 4: 0 / 11
• Subtask 5: 0 / 16
• Subtask 6: 0 / 19
• Subtask 7: 4 / 5
• Subtask 8: 1.86 / 5
• Subtask 9: 0.7494 / 5
• Subtask 10: 0.3214 / 5
• Subtask 11: 0.375 / 5
• Subtask 12: 0.125 / 5