oj.uz

답안 #609593

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
609593 2022-07-27T17:46:57 Z sword060 Paint By Numbers (IOI16_paint) C++17
7 / 100
 1 ms 300 KB 
#include <bits/stdc++.h>
#include "paint.h"
using namespace std;
string solve_puzzle(string s, vector<int>c){
  int x=s.size();
  int lol[x+1];
  for(int i=0;i<x;i++)lol[i]=0;
  for(int i=x-c[0];i<c[0];i++)lol[i]=1;
  string ans="";
  for(int j=0;j<x;j++)ans+=(lol[j]?'X':'?');
  return ans;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
0 / 3.0

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

Subtask #3
0 / 22.0

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

Subtask #4
0 / 27.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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