Submission #758

#TimeUsernameProblemLanguageResultExecution timeMemory
758CodingIsHard파일 삭제 (GA3_delete)C++98
15 / 120
0 ms952 KiB
#define MAX_N 10000 int dir[MAX_N]; int DeletePlan( int N, int M, int K, int *A, int *B) { for(int i = 0;i < N;i++) dir[A[i]]++; dir[0] += dir[1]; if(dir[0] == K) return 1; else if(dir[1] <= K) return 1 + K - dir[1]; else return K; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...