oj.uz

Submission #195627

# Submission time Handle Problem Language Result Execution time Memory
195627 2020-01-16T16:18:48 Z juanmartinez111 Paint By Numbers (IOI16_paint) C++14
32 / 100
 6 ms 424 KB 
#include "paint.h"

#include <cstdlib>
using namespace std;
int visi[104];
int minimo=0;
long long cx=0,n;
vector<int>paredes,posible;
string nw="";

std::string solve_puzzle(std::string s, std::vector<int> c) {
    string a="",hay="",nw="",b="";
    for(int i=0;i<s.size();i++)visi[i]=-1;
    for(int i=0;i<c.size();i++){
        for(int j=0;j<c[i];j++)hay+='X';
        if(i+1<c.size())hay+='_';
    }
    for(int i=0;i<s.size();i++){
        if(b.size()+hay.size()>s.size())break;
        nw="";
        nw+=b;
        nw+=hay;
        while(nw.size()<s.size())nw+='.';
        for(int j=0;j<nw.size();j++){
            if(visi[j]==-1){
                if(nw[j]=='_')visi[j]=1;
                else if(nw[j]=='X')visi[j]=2;
                else visi[j]=0;
            }
            else if(nw[j]=='.' and visi[j]!=0)visi[j]=3;
            else if(nw[j]=='_' and visi[j]!=1)visi[j]=3;
            else if(nw[j]=='X' and visi[j]!=2)visi[j]=3;
        }
        b+='.';
    }
    for(int i=0;i<s.size();i++){
        if(visi[i]==3)a+='?';
        else if(visi[i]==1)a+='_';
        else if(visi[i]==2)a+='X';
        else a+='.';
    }
    return a;
}

Compilation message

paint.cpp: In function 'std::__cxx11::string solve_puzzle(std::__cxx11::string, std::vector<int>)':
paint.cpp:13:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<s.size();i++)visi[i]=-1;
                 ~^~~~~~~~~
paint.cpp:14:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<c.size();i++){
                 ~^~~~~~~~~
paint.cpp:16:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(i+1<c.size())hay+='_';
            ~~~^~~~~~~~~
paint.cpp:18:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<s.size();i++){
                 ~^~~~~~~~~
paint.cpp:24:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0;j<nw.size();j++){
                     ~^~~~~~~~~~
paint.cpp:36:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<s.size();i++){
                 ~^~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 424 KB n = 13, m = 1
2 Correct 2 ms 376 KB n = 18, m = 1
3 Correct 2 ms 296 KB n = 17, m = 1
4 Correct 2 ms 376 KB n = 1, m = 1
5 Correct 2 ms 348 KB n = 20, m = 1
6 Correct 1 ms 376 KB n = 20, m = 1
7 Correct 2 ms 256 KB n = 20, m = 1

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 424 KB n = 13, m = 1
2 Correct 2 ms 376 KB n = 18, m = 1
3 Correct 2 ms 296 KB n = 17, m = 1
4 Correct 2 ms 376 KB n = 1, m = 1
5 Correct 2 ms 348 KB n = 20, m = 1
6 Correct 1 ms 376 KB n = 20, m = 1
7 Correct 2 ms 256 KB n = 20, m = 1
8 Correct 2 ms 404 KB n = 20, m = 5
9 Correct 2 ms 376 KB n = 18, m = 3
10 Correct 2 ms 348 KB n = 17, m = 2
11 Correct 6 ms 376 KB n = 20, m = 2
12 Correct 2 ms 256 KB n = 17, m = 4
13 Correct 2 ms 380 KB n = 17, m = 6
14 Correct 2 ms 256 KB n = 17, m = 1
15 Correct 1 ms 424 KB n = 17, m = 4
16 Correct 1 ms 356 KB n = 13, m = 3
17 Correct 2 ms 256 KB n = 18, m = 4
18 Correct 2 ms 352 KB n = 20, m = 10
19 Correct 2 ms 356 KB n = 19, m = 10

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 424 KB n = 13, m = 1
2 Correct 2 ms 376 KB n = 18, m = 1
3 Correct 2 ms 296 KB n = 17, m = 1
4 Correct 2 ms 376 KB n = 1, m = 1
5 Correct 2 ms 348 KB n = 20, m = 1
6 Correct 1 ms 376 KB n = 20, m = 1
7 Correct 2 ms 256 KB n = 20, m = 1
8 Correct 2 ms 404 KB n = 20, m = 5
9 Correct 2 ms 376 KB n = 18, m = 3
10 Correct 2 ms 348 KB n = 17, m = 2
11 Correct 6 ms 376 KB n = 20, m = 2
12 Correct 2 ms 256 KB n = 17, m = 4
13 Correct 2 ms 380 KB n = 17, m = 6
14 Correct 2 ms 256 KB n = 17, m = 1
15 Correct 1 ms 424 KB n = 17, m = 4
16 Correct 1 ms 356 KB n = 13, m = 3
17 Correct 2 ms 256 KB n = 18, m = 4
18 Correct 2 ms 352 KB n = 20, m = 10
19 Correct 2 ms 356 KB n = 19, m = 10
20 Correct 2 ms 376 KB n = 100, m = 5
21 Correct 2 ms 276 KB n = 90, m = 3
22 Correct 2 ms 348 KB n = 86, m = 2
23 Correct 2 ms 348 KB n = 81, m = 4
24 Correct 2 ms 256 KB n = 89, m = 10
25 Correct 2 ms 348 KB n = 81, m = 23
26 Correct 2 ms 348 KB n = 86, m = 8
27 Correct 4 ms 388 KB n = 53, m = 22
28 Correct 2 ms 348 KB n = 89, m = 35
29 Correct 2 ms 384 KB n = 63, m = 25
30 Correct 2 ms 348 KB n = 100, m = 50
31 Correct 0 ms 256 KB n = 99, m = 50

Subtask #4
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 424 KB n = 13, m = 1
2 Correct 2 ms 376 KB n = 18, m = 1
3 Correct 2 ms 296 KB n = 17, m = 1
4 Correct 2 ms 376 KB n = 1, m = 1
5 Correct 2 ms 348 KB n = 20, m = 1
6 Correct 1 ms 376 KB n = 20, m = 1
7 Correct 2 ms 256 KB n = 20, m = 1
8 Correct 2 ms 404 KB n = 20, m = 5
9 Correct 2 ms 376 KB n = 18, m = 3
10 Correct 2 ms 348 KB n = 17, m = 2
11 Correct 6 ms 376 KB n = 20, m = 2
12 Correct 2 ms 256 KB n = 17, m = 4
13 Correct 2 ms 380 KB n = 17, m = 6
14 Correct 2 ms 256 KB n = 17, m = 1
15 Correct 1 ms 424 KB n = 17, m = 4
16 Correct 1 ms 356 KB n = 13, m = 3
17 Correct 2 ms 256 KB n = 18, m = 4
18 Correct 2 ms 352 KB n = 20, m = 10
19 Correct 2 ms 356 KB n = 19, m = 10
20 Correct 2 ms 376 KB n = 100, m = 5
21 Correct 2 ms 276 KB n = 90, m = 3
22 Correct 2 ms 348 KB n = 86, m = 2
23 Correct 2 ms 348 KB n = 81, m = 4
24 Correct 2 ms 256 KB n = 89, m = 10
25 Correct 2 ms 348 KB n = 81, m = 23
26 Correct 2 ms 348 KB n = 86, m = 8
27 Correct 4 ms 388 KB n = 53, m = 22
28 Correct 2 ms 348 KB n = 89, m = 35
29 Correct 2 ms 384 KB n = 63, m = 25
30 Correct 2 ms 348 KB n = 100, m = 50
31 Correct 0 ms 256 KB n = 99, m = 50
32 Incorrect 2 ms 256 KB char #1 differ - expected: 'X', found: '?'
33 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 424 KB n = 13, m = 1
2 Correct 2 ms 376 KB n = 18, m = 1
3 Correct 2 ms 296 KB n = 17, m = 1
4 Correct 2 ms 376 KB n = 1, m = 1
5 Correct 2 ms 348 KB n = 20, m = 1
6 Correct 1 ms 376 KB n = 20, m = 1
7 Correct 2 ms 256 KB n = 20, m = 1
8 Correct 2 ms 404 KB n = 20, m = 5
9 Correct 2 ms 376 KB n = 18, m = 3
10 Correct 2 ms 348 KB n = 17, m = 2
11 Correct 6 ms 376 KB n = 20, m = 2
12 Correct 2 ms 256 KB n = 17, m = 4
13 Correct 2 ms 380 KB n = 17, m = 6
14 Correct 2 ms 256 KB n = 17, m = 1
15 Correct 1 ms 424 KB n = 17, m = 4
16 Correct 1 ms 356 KB n = 13, m = 3
17 Correct 2 ms 256 KB n = 18, m = 4
18 Correct 2 ms 352 KB n = 20, m = 10
19 Correct 2 ms 356 KB n = 19, m = 10
20 Correct 2 ms 376 KB n = 100, m = 5
21 Correct 2 ms 276 KB n = 90, m = 3
22 Correct 2 ms 348 KB n = 86, m = 2
23 Correct 2 ms 348 KB n = 81, m = 4
24 Correct 2 ms 256 KB n = 89, m = 10
25 Correct 2 ms 348 KB n = 81, m = 23
26 Correct 2 ms 348 KB n = 86, m = 8
27 Correct 4 ms 388 KB n = 53, m = 22
28 Correct 2 ms 348 KB n = 89, m = 35
29 Correct 2 ms 384 KB n = 63, m = 25
30 Correct 2 ms 348 KB n = 100, m = 50
31 Correct 0 ms 256 KB n = 99, m = 50
32 Incorrect 2 ms 256 KB char #1 differ - expected: 'X', found: '?'
33 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 424 KB n = 13, m = 1
2 Correct 2 ms 376 KB n = 18, m = 1
3 Correct 2 ms 296 KB n = 17, m = 1
4 Correct 2 ms 376 KB n = 1, m = 1
5 Correct 2 ms 348 KB n = 20, m = 1
6 Correct 1 ms 376 KB n = 20, m = 1
7 Correct 2 ms 256 KB n = 20, m = 1
8 Correct 2 ms 404 KB n = 20, m = 5
9 Correct 2 ms 376 KB n = 18, m = 3
10 Correct 2 ms 348 KB n = 17, m = 2
11 Correct 6 ms 376 KB n = 20, m = 2
12 Correct 2 ms 256 KB n = 17, m = 4
13 Correct 2 ms 380 KB n = 17, m = 6
14 Correct 2 ms 256 KB n = 17, m = 1
15 Correct 1 ms 424 KB n = 17, m = 4
16 Correct 1 ms 356 KB n = 13, m = 3
17 Correct 2 ms 256 KB n = 18, m = 4
18 Correct 2 ms 352 KB n = 20, m = 10
19 Correct 2 ms 356 KB n = 19, m = 10
20 Correct 2 ms 376 KB n = 100, m = 5
21 Correct 2 ms 276 KB n = 90, m = 3
22 Correct 2 ms 348 KB n = 86, m = 2
23 Correct 2 ms 348 KB n = 81, m = 4
24 Correct 2 ms 256 KB n = 89, m = 10
25 Correct 2 ms 348 KB n = 81, m = 23
26 Correct 2 ms 348 KB n = 86, m = 8
27 Correct 4 ms 388 KB n = 53, m = 22
28 Correct 2 ms 348 KB n = 89, m = 35
29 Correct 2 ms 384 KB n = 63, m = 25
30 Correct 2 ms 348 KB n = 100, m = 50
31 Correct 0 ms 256 KB n = 99, m = 50
32 Incorrect 2 ms 256 KB char #1 differ - expected: 'X', found: '?'
33 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 424 KB n = 13, m = 1
2 Correct 2 ms 376 KB n = 18, m = 1
3 Correct 2 ms 296 KB n = 17, m = 1
4 Correct 2 ms 376 KB n = 1, m = 1
5 Correct 2 ms 348 KB n = 20, m = 1
6 Correct 1 ms 376 KB n = 20, m = 1
7 Correct 2 ms 256 KB n = 20, m = 1
8 Correct 2 ms 404 KB n = 20, m = 5
9 Correct 2 ms 376 KB n = 18, m = 3
10 Correct 2 ms 348 KB n = 17, m = 2
11 Correct 6 ms 376 KB n = 20, m = 2
12 Correct 2 ms 256 KB n = 17, m = 4
13 Correct 2 ms 380 KB n = 17, m = 6
14 Correct 2 ms 256 KB n = 17, m = 1
15 Correct 1 ms 424 KB n = 17, m = 4
16 Correct 1 ms 356 KB n = 13, m = 3
17 Correct 2 ms 256 KB n = 18, m = 4
18 Correct 2 ms 352 KB n = 20, m = 10
19 Correct 2 ms 356 KB n = 19, m = 10
20 Correct 2 ms 376 KB n = 100, m = 5
21 Correct 2 ms 276 KB n = 90, m = 3
22 Correct 2 ms 348 KB n = 86, m = 2
23 Correct 2 ms 348 KB n = 81, m = 4
24 Correct 2 ms 256 KB n = 89, m = 10
25 Correct 2 ms 348 KB n = 81, m = 23
26 Correct 2 ms 348 KB n = 86, m = 8
27 Correct 4 ms 388 KB n = 53, m = 22
28 Correct 2 ms 348 KB n = 89, m = 35
29 Correct 2 ms 384 KB n = 63, m = 25
30 Correct 2 ms 348 KB n = 100, m = 50
31 Correct 0 ms 256 KB n = 99, m = 50
32 Incorrect 2 ms 256 KB char #1 differ - expected: 'X', found: '?'
33 Halted 0 ms 0 KB -