Submission #1359165

#TimeUsernameProblemLanguageResultExecution timeMemory
1359165cansu_mutlu코알라 (APIO17_koala)C++20
28 / 100
19 ms444 KiB
#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
int n;
int minValue(int n, int W) {
    int cur = 0;
    int b[n],r[n];
    for(int i=1;i<n;i++) b[i]=0;
    b[0] = 1;
    playRound(b,r);
    for(int i=1;i<n;i++)
    {
        if(r[i]==0)cur = i;
    }
    return cur;
}
bool cmp(int x,int y)
{
    int b[n],r[n];
    for(int i=0;i<n;i++) b[i] = 0;
    int l = 1,ri = 14;
    while(l<=ri)
    {
        int mid = (l+ri)/2;
        b[x] = b[y] = mid;
        playRound(b,r);
        if((r[x]>mid && r[y]>mid))
        {
            l = mid+1;
        }
        else 
        {
            ri = mid-1;
            if(max(r[x],r[y])>mid && min(r[x],r[y])<=mid)
            {
                return r[x]<r[y];
            }
        }
    }
}
int maxValue(int N, int W) {
    // TODO: Implement Subtask 2 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;
}

int greaterValue(int n, int W) {
    int cur = 0;
    
    return cur;
}

void allValues(int N, int W, int *p) {
    n = N;
    vector<int> a(n);
    for(int i=0;i<n;i++) a[i] = i;
    sort(a.begin(),a.end(),cmp);
    for(int i=0;i<n;i++)
    {
        p[a[i]] = i+1;
    }
}

Compilation message (stderr)

koala.cpp: In function 'bool cmp(int, int)':
koala.cpp:40:1: warning: control reaches end of non-void function [-Wreturn-type]
   40 | }
      | ^
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...