Submission #131911

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
131911	2019-07-18T03:48:33 Z	Masterdan	Paint By Numbers (IOI16_paint)	C++14	32 / 100	2 ms	424 KB

paint

#include "paint.h"
#include <bits/stdc++.h>
#define MIN -1
#define MAX 1000000000
#define all(a)  a.begin (), a.end ()
#define  pb  push_back
#define  mp   make-pair
using namespace  std;
typedef vector <int>  vi;
typedef long long int ll;
typedef pair <int, int> ii;
string solve_puzzle(string s, vector<int> c) {
    string res;
    int n=s.size ();
    int k=c.size ();
    vector <int> v1;
    for(int i=0;i<k;i++){
    //if(c1==k)break;
    int t=i;
        for(int j=0;j<c[i];j++){
            res+='X';
        }
        v1.pb(res.size ());
        if(res.size()==n)break;
        res+='_';
    }
    int s1=1;
    //cout<<res<<endl;
    if(res[res.size ()-1]!='_'){
    return res;
    }else{
        for(int i=res.size ();i<n;i++){res+='_';s1++;}
    }
    int aux[n+1];
    //cout<<res<<endl;
    int j=0;
    string gg;
    gg.resize(res.size ());
    /*for(int i=0;i<v1.size ();i++)cout<<v1[i]<<" ";
    cout<<endl;*/
    for(int i=0;i<res.size();i++){
        if(res[i]=='X'){
	  if(v1[j]-1>=i+s1){
            if(res[i+s1]=='X'){
                gg[i+s1]='X';
            }
	  }
	  if(i==v1[j]-1){
	    j++;
	  }
        }
        //cout<<res<<endl;
    }
    /*for(int i=0;i<n;i++)cout<<aux[i]<<" ";
    cout<<endl;*/
    for(int i=0;i<gg.size ();i++){
        if(gg[i]!='X')gg[i]='?';
        if(s[i]=='_')gg[i]='_';
    }
    return gg;
}
/*
const int S_MAX_LEN = 200 * 1000;
char buf[S_MAX_LEN + 1];

int main() {
    assert(1 == scanf("%s", buf));
    std::string s = buf;
    int c_len;
    assert(1 == scanf("%d", &c_len));
    std::vector<int> c(c_len);
    for (int i = 0; i < c_len; i++) {
        assert(1 == scanf("%d", &c[i]));
    }
    std::string ans = solve_puzzle(s, c);


    printf("%s\n", ans.data());
    return 0;
}

*/

Compilation message

paint.cpp: In function 'std::__cxx11::string solve_puzzle(std::__cxx11::string, std::vector<int>)':
paint.cpp:24:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(res.size()==n)break;
            ~~~~~~~~~~^~~
paint.cpp:19:9: warning: unused variable 't' [-Wunused-variable]
     int t=i;
         ^
paint.cpp:41:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<res.size();i++){
                 ~^~~~~~~~~~~
paint.cpp:56:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<gg.size ();i++){
                 ~^~~~~~~~~~~
paint.cpp:34:9: warning: unused variable 'aux' [-Wunused-variable]
     int aux[n+1];
         ^~~

Subtask #1
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	n = 13, m = 1
2	Correct	2 ms	376 KB	n = 18, m = 1
3	Correct	2 ms	376 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
3.0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	n = 13, m = 1
2	Correct	2 ms	376 KB	n = 18, m = 1
3	Correct	2 ms	376 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	Correct	2 ms	256 KB	n = 20, m = 5
9	Correct	2 ms	376 KB	n = 18, m = 3
10	Correct	2 ms	376 KB	n = 17, m = 2
11	Correct	2 ms	376 KB	n = 20, m = 2
12	Correct	2 ms	376 KB	n = 17, m = 4
13	Correct	2 ms	376 KB	n = 17, m = 6
14	Correct	2 ms	376 KB	n = 17, m = 1
15	Correct	2 ms	256 KB	n = 17, m = 4
16	Correct	2 ms	252 KB	n = 13, m = 3
17	Correct	2 ms	256 KB	n = 18, m = 4
18	Correct	2 ms	376 KB	n = 20, m = 10
19	Correct	2 ms	376 KB	n = 19, m = 10

Subtask #3
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	n = 13, m = 1
2	Correct	2 ms	376 KB	n = 18, m = 1
3	Correct	2 ms	376 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	Correct	2 ms	256 KB	n = 20, m = 5
9	Correct	2 ms	376 KB	n = 18, m = 3
10	Correct	2 ms	376 KB	n = 17, m = 2
11	Correct	2 ms	376 KB	n = 20, m = 2
12	Correct	2 ms	376 KB	n = 17, m = 4
13	Correct	2 ms	376 KB	n = 17, m = 6
14	Correct	2 ms	376 KB	n = 17, m = 1
15	Correct	2 ms	256 KB	n = 17, m = 4
16	Correct	2 ms	252 KB	n = 13, m = 3
17	Correct	2 ms	256 KB	n = 18, m = 4
18	Correct	2 ms	376 KB	n = 20, m = 10
19	Correct	2 ms	376 KB	n = 19, m = 10
20	Correct	2 ms	380 KB	n = 100, m = 5
21	Correct	2 ms	420 KB	n = 90, m = 3
22	Correct	2 ms	256 KB	n = 86, m = 2
23	Correct	2 ms	376 KB	n = 81, m = 4
24	Correct	2 ms	376 KB	n = 89, m = 10
25	Correct	2 ms	376 KB	n = 81, m = 23
26	Correct	2 ms	424 KB	n = 86, m = 8
27	Correct	2 ms	376 KB	n = 53, m = 22
28	Correct	2 ms	380 KB	n = 89, m = 35
29	Correct	2 ms	256 KB	n = 63, m = 25
30	Correct	2 ms	376 KB	n = 100, m = 50
31	Correct	2 ms	376 KB	n = 99, m = 50

Subtask #4
0 / 27.0

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

Submission #131911

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 3.0 / 3.0

Subtask #3 22.0 / 22.0

Subtask #4 0 / 27.0

Subtask #5 0 / 21.0

Subtask #6 0 / 10.0

Subtask #7 0 / 10.0

Subtask #1
7.0 / 7.0

Subtask #2
3.0 / 3.0

Subtask #3
22.0 / 22.0

Subtask #4
0 / 27.0

Subtask #5
0 / 21.0

Subtask #6
0 / 10.0

Subtask #7
0 / 10.0