# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1210808 | islam_2010 | 경주 (Race) (IOI11_race) | C++20 | 1 ms | 320 KiB |
#pragma GCC optimize("O3")
#include "race.h"
#include <bits/stdc++.h>
using namespace std;
const int sz = 1e5+5;
int best_path(int n, int k, int h[][2], int l[]){
int s = 0;
for(int i = 0; i < n; i++){
s+=l[i];
if(s==k){
return i+1;
}
}return -1;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |