제출 #1328998

#제출 시각아이디문제언어결과실행 시간메모리
1328998jasonic곤돌라 (IOI14_gondola)C++20
0 / 100
1 ms420 KiB
#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;
#define ll long long 

int valid(int n, int a[]) {
    int offset = -1;
    bool valid = true;
    for(int i = 0; i < n; i++) {
        if(a[i] <= n) {
            if(offset == -1) offset = a[i] - i;
            else if(offset != a[i] - i) valid = false;
        }
    }

    return valid;
}

int replacement(int n, int a[], int rep[]) {

}

const ll M = 1e9 + 9; // prime
int countReplacement(int n, int a[]) {

}

컴파일 시 표준 에러 (stderr) 메시지

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:22:1: warning: no return statement in function returning non-void [-Wreturn-type]
   22 | }
      | ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:27:1: warning: no return statement in function returning non-void [-Wreturn-type]
   27 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...