oj.uz

Submission #758

# Submission time Handle Problem Language Result Execution time Memory
758 2013-03-02T07:39:43 Z CodingIsHard 파일 삭제 (GA3_delete) C++
15 / 120
 0 ms 952 KB 
#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;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 952 KB Output is correct
2 Correct 0 ms 952 KB Output is correct
3 Correct 0 ms 952 KB Output is correct
4 Correct 0 ms 952 KB Output is correct
5 Correct 0 ms 952 KB Output is correct

Subtask #2
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 952 KB Output isn't correct
2 Halted 0 ms 0 KB -
3 Halted 0 ms 0 KB -
4 Halted 0 ms 0 KB -
5 Halted 0 ms 0 KB -
6 Halted 0 ms 0 KB -
7 Halted 0 ms 0 KB -
8 Halted 0 ms 0 KB -
9 Halted 0 ms 0 KB -
10 Halted 0 ms 0 KB -

Subtask #3
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 952 KB Output isn't correct
2 Halted 0 ms 0 KB -
3 Halted 0 ms 0 KB -
4 Halted 0 ms 0 KB -
5 Halted 0 ms 0 KB -
6 Halted 0 ms 0 KB -
7 Halted 0 ms 0 KB -
8 Halted 0 ms 0 KB -
9 Halted 0 ms 0 KB -
10 Halted 0 ms 0 KB -
11 Halted 0 ms 0 KB -
12 Halted 0 ms 0 KB -
13 Halted 0 ms 0 KB -
14 Halted 0 ms 0 KB -
15 Halted 0 ms 0 KB -

Subtask #4
0.0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 952 KB Output isn't correct
2 Halted 0 ms 0 KB -
3 Halted 0 ms 0 KB -
4 Halted 0 ms 0 KB -
5 Halted 0 ms 0 KB -
6 Halted 0 ms 0 KB -
7 Halted 0 ms 0 KB -
8 Halted 0 ms 0 KB -
9 Halted 0 ms 0 KB -
10 Halted 0 ms 0 KB -
11 Halted 0 ms 0 KB -
12 Halted 0 ms 0 KB -
13 Halted 0 ms 0 KB -
14 Halted 0 ms 0 KB -
15 Halted 0 ms 0 KB -