oj.uz

답안 #170178

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
170178 2019-12-24T07:13:36 Z ksmzzang2003 Paint By Numbers (IOI16_paint) C++14
7 / 100
 2 ms 376 KB 
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;

string solve_puzzle(string s, vector<int> c) {
    int N = s.size();
    if(c.size()==1) {
        string A = s, B= s,C=s;
        for(int i=0; i<c[0]; i++)
            B[N-1-i]=A[i] = 'X';
        for(int i=0; i<s.size(); i++) {
            if(A[i] == B[i] && A[i]=='X')
                C[i] = 'X';
            else C[i] = '?';
        }
        return C;
    }
}

Compilation message

paint.cpp: In function 'std::__cxx11::string solve_puzzle(std::__cxx11::string, std::vector<int>)':
paint.cpp:11:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0; i<s.size(); i++) {
                      ~^~~~~~~~~
paint.cpp:18:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB n = 13, m = 1
2 Correct 2 ms 376 KB n = 18, m = 1
3 Correct 2 ms 256 KB n = 17, m = 1
4 Correct 2 ms 256 KB n = 1, m = 1
5 Correct 2 ms 376 KB n = 20, m = 1
6 Correct 2 ms 376 KB n = 20, m = 1
7 Correct 2 ms 376 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 376 KB n = 18, m = 1
3 Correct 2 ms 256 KB n = 17, m = 1
4 Correct 2 ms 256 KB n = 1, m = 1
5 Correct 2 ms 376 KB n = 20, m = 1
6 Correct 2 ms 376 KB n = 20, m = 1
7 Correct 2 ms 376 KB n = 20, m = 1
8 Runtime error 2 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
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 376 KB n = 18, m = 1
3 Correct 2 ms 256 KB n = 17, m = 1
4 Correct 2 ms 256 KB n = 1, m = 1
5 Correct 2 ms 376 KB n = 20, m = 1
6 Correct 2 ms 376 KB n = 20, m = 1
7 Correct 2 ms 376 KB n = 20, m = 1
8 Runtime error 2 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
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 376 KB n = 18, m = 1
3 Correct 2 ms 256 KB n = 17, m = 1
4 Correct 2 ms 256 KB n = 1, m = 1
5 Correct 2 ms 376 KB n = 20, m = 1
6 Correct 2 ms 376 KB n = 20, m = 1
7 Correct 2 ms 376 KB n = 20, m = 1
8 Runtime error 2 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
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 376 KB n = 18, m = 1
3 Correct 2 ms 256 KB n = 17, m = 1
4 Correct 2 ms 256 KB n = 1, m = 1
5 Correct 2 ms 376 KB n = 20, m = 1
6 Correct 2 ms 376 KB n = 20, m = 1
7 Correct 2 ms 376 KB n = 20, m = 1
8 Runtime error 2 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
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 376 KB n = 18, m = 1
3 Correct 2 ms 256 KB n = 17, m = 1
4 Correct 2 ms 256 KB n = 1, m = 1
5 Correct 2 ms 376 KB n = 20, m = 1
6 Correct 2 ms 376 KB n = 20, m = 1
7 Correct 2 ms 376 KB n = 20, m = 1
8 Runtime error 2 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
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 376 KB n = 18, m = 1
3 Correct 2 ms 256 KB n = 17, m = 1
4 Correct 2 ms 256 KB n = 1, m = 1
5 Correct 2 ms 376 KB n = 20, m = 1
6 Correct 2 ms 376 KB n = 20, m = 1
7 Correct 2 ms 376 KB n = 20, m = 1
8 Runtime error 2 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Halted 0 ms 0 KB -