oj.uz

답안 #1044971

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1044971 2024-08-05T15:14:21 Z RecursiveCo 자동 인형 (IOI18_doll) C++17
2 / 100
 11 ms 3160 KB 
#include <bits/stdc++.h>
#include "doll.h"

using namespace std;

#define out(o) cout << o

void create_circuit(int M, vector<int> A) {
    int N = A.size();
    vector<int> C(M + 1, 0);
    vector<int> X;
    vector<int> Y;
    C[0] = A[0];
    for (int i = 0; i < N; i++) C[A[i]] = i == N - 1? 0: A[i + 1];
    answer(C, X, Y);
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 9 ms 2360 KB Output is correct
3 Correct 7 ms 1984 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 5 ms 1456 KB Output is correct
6 Correct 11 ms 2992 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 9 ms 2360 KB Output is correct
3 Correct 7 ms 1984 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 5 ms 1456 KB Output is correct
6 Correct 11 ms 2992 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 11 ms 3160 KB wrong motion
9 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 9 ms 2360 KB Output is correct
3 Correct 7 ms 1984 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 5 ms 1456 KB Output is correct
6 Correct 11 ms 2992 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 11 ms 3160 KB wrong motion
9 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB wrong motion
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB wrong motion
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB wrong motion
2 Halted 0 ms 0 KB -