oj.uz

답안 #92610

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
92610 2019-01-04T03:34:49 Z Badral Paint By Numbers (IOI16_paint) C++17
7 / 100
 2 ms 400 KB 
#include<bits/stdc++.h>

using namespace std;
int a[1000005];

string solve_puzzle(string s, vector<int> c) {
    int k = c[0];
    for(int i = 0; i < k; i++) a[i]++;
    for(int i = (int)s.size(); i >= (int)s.size()-k; i--) a[i]++;
    string sss;
    for(int i = 0; i < (int)s.size(); i++) {
        if(a[i] == 2) sss += 'X';
        else sss += '?';
    }
    return sss;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n = 13, m = 1
2 Correct 2 ms 256 KB n = 18, m = 1
3 Correct 2 ms 376 KB n = 17, m = 1
4 Correct 2 ms 376 KB n = 1, m = 1
5 Correct 1 ms 256 KB n = 20, m = 1
6 Correct 2 ms 376 KB n = 20, m = 1
7 Correct 2 ms 400 KB n = 20, m = 1

Subtask #2
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n = 13, m = 1
2 Correct 2 ms 256 KB n = 18, m = 1
3 Correct 2 ms 376 KB n = 17, m = 1
4 Correct 2 ms 376 KB n = 1, m = 1
5 Correct 1 ms 256 KB n = 20, m = 1
6 Correct 2 ms 376 KB n = 20, m = 1
7 Correct 2 ms 400 KB n = 20, m = 1
8 Incorrect 2 ms 380 KB char #4 differ - expected: 'X', found: '?'
9 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n = 13, m = 1
2 Correct 2 ms 256 KB n = 18, m = 1
3 Correct 2 ms 376 KB n = 17, m = 1
4 Correct 2 ms 376 KB n = 1, m = 1
5 Correct 1 ms 256 KB n = 20, m = 1
6 Correct 2 ms 376 KB n = 20, m = 1
7 Correct 2 ms 400 KB n = 20, m = 1
8 Incorrect 2 ms 380 KB char #4 differ - expected: 'X', found: '?'
9 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n = 13, m = 1
2 Correct 2 ms 256 KB n = 18, m = 1
3 Correct 2 ms 376 KB n = 17, m = 1
4 Correct 2 ms 376 KB n = 1, m = 1
5 Correct 1 ms 256 KB n = 20, m = 1
6 Correct 2 ms 376 KB n = 20, m = 1
7 Correct 2 ms 400 KB n = 20, m = 1
8 Incorrect 2 ms 380 KB char #4 differ - expected: 'X', found: '?'
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n = 13, m = 1
2 Correct 2 ms 256 KB n = 18, m = 1
3 Correct 2 ms 376 KB n = 17, m = 1
4 Correct 2 ms 376 KB n = 1, m = 1
5 Correct 1 ms 256 KB n = 20, m = 1
6 Correct 2 ms 376 KB n = 20, m = 1
7 Correct 2 ms 400 KB n = 20, m = 1
8 Incorrect 2 ms 380 KB char #4 differ - expected: 'X', found: '?'
9 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n = 13, m = 1
2 Correct 2 ms 256 KB n = 18, m = 1
3 Correct 2 ms 376 KB n = 17, m = 1
4 Correct 2 ms 376 KB n = 1, m = 1
5 Correct 1 ms 256 KB n = 20, m = 1
6 Correct 2 ms 376 KB n = 20, m = 1
7 Correct 2 ms 400 KB n = 20, m = 1
8 Incorrect 2 ms 380 KB char #4 differ - expected: 'X', found: '?'
9 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n = 13, m = 1
2 Correct 2 ms 256 KB n = 18, m = 1
3 Correct 2 ms 376 KB n = 17, m = 1
4 Correct 2 ms 376 KB n = 1, m = 1
5 Correct 1 ms 256 KB n = 20, m = 1
6 Correct 2 ms 376 KB n = 20, m = 1
7 Correct 2 ms 400 KB n = 20, m = 1
8 Incorrect 2 ms 380 KB char #4 differ - expected: 'X', found: '?'
9 Halted 0 ms 0 KB -