oj.uz

Submission #600527

# Submission time Handle Problem Language Result Execution time Memory
600527 2022-07-21T02:25:29 Z ChickTheNugget Paint By Numbers (IOI16_paint) C++17
7 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long 
#define ld long double 
#define INF 1e9
#define MOD 1e9 + 7
#define MAXN 1000

string solve_puzzle(string s, vector<int> c)
{
    int n = s.size();
    int k = c.size();
    string ans = "";
    if (c[0] > (n / 2)){
        for (int i = 0; i < n - c[0]; i++){
            ans += "?";
        }
        for (int i = 0; i < abs(n - 2 * c[0]); i++){
            ans += "X";
        }

        for (int i = 0; i < n - c[0]; i++){
            ans += "?";
        }
    }
    else{
        for (int i = 0; i < n; i++){
            ans += "?";
        }
    }
    return ans;
}

// int main()
// {
//     ios_base::sync_with_stdio(0);
//     cin.tie(0); cout.tie(0);
//     #ifndef ONLINE_JUDGE
//     freopen("input.txt", "r", stdin);
//     freopen("output.txt", "w", stdout);
//     #endif
//     cout << solve_puzzle("........", {6});
// }

Compilation message

paint.cpp: In function 'std::string solve_puzzle(std::string, std::vector<int>)':
paint.cpp:13:9: warning: unused variable 'k' [-Wunused-variable]
   13 |     int k = c.size();
      |         ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 13, m = 1
2 Correct 1 ms 212 KB n = 18, m = 1
3 Correct 0 ms 212 KB n = 17, m = 1
4 Correct 1 ms 212 KB n = 1, m = 1
5 Correct 0 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 13, m = 1
2 Correct 1 ms 212 KB n = 18, m = 1
3 Correct 0 ms 212 KB n = 17, m = 1
4 Correct 1 ms 212 KB n = 1, m = 1
5 Correct 0 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 13, m = 1
2 Correct 1 ms 212 KB n = 18, m = 1
3 Correct 0 ms 212 KB n = 17, m = 1
4 Correct 1 ms 212 KB n = 1, m = 1
5 Correct 0 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 13, m = 1
2 Correct 1 ms 212 KB n = 18, m = 1
3 Correct 0 ms 212 KB n = 17, m = 1
4 Correct 1 ms 212 KB n = 1, m = 1
5 Correct 0 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 13, m = 1
2 Correct 1 ms 212 KB n = 18, m = 1
3 Correct 0 ms 212 KB n = 17, m = 1
4 Correct 1 ms 212 KB n = 1, m = 1
5 Correct 0 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 13, m = 1
2 Correct 1 ms 212 KB n = 18, m = 1
3 Correct 0 ms 212 KB n = 17, m = 1
4 Correct 1 ms 212 KB n = 1, m = 1
5 Correct 0 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 13, m = 1
2 Correct 1 ms 212 KB n = 18, m = 1
3 Correct 0 ms 212 KB n = 17, m = 1
4 Correct 1 ms 212 KB n = 1, m = 1
5 Correct 0 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 -