oj.uz

Submission #984142

# Submission time Handle Problem Language Result Execution time Memory
984142 2024-05-16T10:41:57 Z ASGA_RedSea Koala Game (APIO17_koala) C++17
0 / 100
 1 ms 356 KB 
/**
 
                                    * بسم الله الرحمن الرحيم *
 
                ﴾ رَبِّ اشْرَحْ لِي صَدْرِي * وَيَسِّرْ لِي أَمْرِي * وَاحْلُلْ عُقْدَةً مِّن لِّسَانِي * يَفْقَهُوا قَوْلِي ﴿
 
*/
 
/// author : "ASGA"
 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
 

void playRound(int b[],int r[]);
 
int minValue(int n,int w){
    return 0;
}
 
int maxValue(int n,int w){
    return --n;
}
 
bool greaterValue(int n,int w){
    int b[n]{},r[n]{};
    b[0] = w - 1;
    playRound(b,r);
    return (r[0] != w);
}
 
void allValues(int n,int w,int p[]){
    for(int i = 0;i < n;i++)p[i] = i + 1;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 356 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -