제출 #675568

#제출 시각아이디문제언어결과실행 시간메모리
675568benjaminkleyn곤돌라 (IOI14_gondola)C++17
0 / 100
2 ms1236 KiB
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
typedef long long ll;

int cnt[250001];
int valid(int n, int inputSeq[])
{
    memset(cnt, 0, sizeof(cnt));
    for (int i = 0; i < n; i++)
    {
        cnt[inputSeq[i]]++;
        if (cnt[inputSeq[i]] > 1)
            return 0;
    }
    return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
}

int countReplacement(int n, int inputSeq[])
{
}

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

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:21:1: warning: no return statement in function returning non-void [-Wreturn-type]
   21 | }
      | ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:25:1: warning: no return statement in function returning non-void [-Wreturn-type]
   25 | }
      | ^
#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...