Submission #236176

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
236176	2020-05-31T12:40:16 Z	nicolaalexandra	Mecho (IOI09_mecho)	C++14	5 / 100	244 ms	9336 KB

mecho

#include <bits/stdc++.h>
#define DIM 810
using namespace std;

char s[DIM];
int a[DIM][DIM],b[DIM][DIM],dist[DIM][DIM],f[DIM];
deque <pair<int,int> > c,aux,d;
int di[] = {-1,1,0,0};
int dj[] = {0,0,-1,1};
int n,nr,i,j,xstart,ystart,xfin,yfin;
inline int inmat (int i, int j){
    if (i >= 1 && j >= 1 && i <= n && j <= n)
        return 1;
    return 0;
}
int verif (int val){

    /// mai intai vad cat se extind albinele dupa val secunde
    c.clear();
    memset (f,0,sizeof f);
    for (i=1;i<=n;i++)
        for (j=1;j<=n;j++){
            b[i][j] = a[i][j];
            if (a[i][j] == 1)
                c.push_back(make_pair(i,j));
        }

    for (i=1;i<=val;i++){
        aux.clear();
        for (auto it : c){
            int ic = it.first, jc = it.second;
            for (int dir=0;dir<=3;dir++){
                int iv = ic + di[dir];
                int jv = jc + dj[dir];
                if (inmat (iv,jv) && b[iv][jv] == 0){
                    aux.push_back(make_pair(iv,jv));
                    b[iv][jv] = 1;
                }}}
        c = aux;
        f[i] = 1;
    }

    if (b[xstart][ystart])
        return 0;

    /// d - lista cu toate locurile in care pot sa ajung pana la secunda asta
    memset (dist,0,sizeof dist);
    d.clear();
    d.push_back(make_pair(xstart,ystart));
    dist[xstart][ystart] = 1;

    while (!d.empty()){
        int ic = d.front().first;
        int jc = d.front().second;
        d.pop_front();

        if (dist[ic][jc] % (nr+1) == 0 && !f[dist[ic][jc] / (nr+1) + val]){
            /// inseamna ca a mai trecut un minut si trb sa avansez cu albinele
            f[dist[ic][jc] / (nr+1) + val] = 1;
            aux.clear();
            for (auto it : c){
                int i = it.first, j = it.second;
                for (int dir=0;dir<=3;dir++){
                    int iv = i + di[dir];
                    int jv = j + dj[dir];
                    if (inmat(iv,jv) && b[iv][jv] == 0){
                        aux.push_back(make_pair(iv,jv));
                        b[iv][jv] = 1;
                    }}}
            c = aux;
        }

        for (int dir=0;dir<=3;dir++){
            int iv = ic + di[dir];
            int jv = jc + dj[dir];
            if (inmat (iv,jv) && (b[iv][jv] == 0 || b[iv][jv] == 3) && !dist[iv][jv]){
                if (iv == xfin && jv == yfin) /// am reusit sa ajung
                    return 1;

                dist[iv][jv] = 1 + dist[ic][jc];
                d.push_back(make_pair(iv,jv));
            }}}

    return 0;

}


int main (){

    //ifstream cin ("date.in");
    //ofstream cout ("date.out");

    cin>>n>>nr;
    for (i=1;i<=n;i++){
        cin>>s+1;
        for (j=1;j<=n;j++){
            if (s[j] == 'T')
                a[i][j] = 2;
            if (s[j] == 'M'){
                xstart = i, ystart = j;
                //a[i][j] = 4;
            }
            if (s[j] == 'D'){
                xfin = i, yfin = j;
                a[i][j] = 3;
            }
            if (s[j] == 'H')
                a[i][j] = 1;
        }
    }
    /*for (i=1;i<=n;i++,cout<<endl)
        for (j=1;j<=n;j++)
            cout<<a[i][j]<<" ";
*/
    int st = 0, dr = n, sol = 0;
    while (st <= dr){
        int mid = (st+dr)>>1;
        if (verif (mid)){
            sol = mid;
            st = mid+1;
        } else dr = mid-1;
    }

    cout<<sol;

    return 0;
}

Compilation message

mecho.cpp: In function 'int main()':
mecho.cpp:96:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
         cin>>s+1;
              ~^~

Subtask #1

5.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	6 ms	2944 KB	Output isn't correct
2	Incorrect	6 ms	2944 KB	Output isn't correct
3	Incorrect	6 ms	2944 KB	Output isn't correct
4	Incorrect	6 ms	2944 KB	Output isn't correct
5	Correct	6 ms	2944 KB	Output is correct
6	Incorrect	6 ms	2944 KB	Output isn't correct
7	Incorrect	202 ms	8056 KB	Output isn't correct
8	Incorrect	6 ms	2944 KB	Output isn't correct
9	Correct	6 ms	2944 KB	Output is correct
10	Incorrect	7 ms	3072 KB	Output isn't correct
11	Incorrect	6 ms	2944 KB	Output isn't correct
12	Incorrect	7 ms	3328 KB	Output isn't correct
13	Correct	7 ms	3200 KB	Output is correct
14	Incorrect	7 ms	3328 KB	Output isn't correct
15	Incorrect	6 ms	3072 KB	Output isn't correct
16	Incorrect	6 ms	3072 KB	Output isn't correct
17	Incorrect	6 ms	3072 KB	Output isn't correct
18	Incorrect	6 ms	3072 KB	Output isn't correct
19	Incorrect	6 ms	3072 KB	Output isn't correct
20	Incorrect	6 ms	3072 KB	Output isn't correct
21	Incorrect	6 ms	3072 KB	Output isn't correct
22	Incorrect	7 ms	3200 KB	Output isn't correct
23	Incorrect	7 ms	3200 KB	Output isn't correct
24	Incorrect	7 ms	3200 KB	Output isn't correct
25	Incorrect	6 ms	3200 KB	Output isn't correct
26	Incorrect	7 ms	3328 KB	Output isn't correct
27	Incorrect	7 ms	3200 KB	Output isn't correct
28	Incorrect	7 ms	3328 KB	Output isn't correct
29	Incorrect	7 ms	3328 KB	Output isn't correct
30	Incorrect	7 ms	3328 KB	Output isn't correct
31	Incorrect	7 ms	3328 KB	Output isn't correct
32	Incorrect	7 ms	3328 KB	Output isn't correct
33	Incorrect	18 ms	5120 KB	Output isn't correct
34	Incorrect	18 ms	5248 KB	Output isn't correct
35	Correct	32 ms	5248 KB	Output is correct
36	Incorrect	21 ms	5504 KB	Output isn't correct
37	Incorrect	21 ms	5632 KB	Output isn't correct
38	Correct	40 ms	5632 KB	Output is correct
39	Incorrect	26 ms	5760 KB	Output isn't correct
40	Incorrect	26 ms	6016 KB	Output isn't correct
41	Correct	50 ms	5888 KB	Output is correct
42	Incorrect	28 ms	6272 KB	Output isn't correct
43	Incorrect	30 ms	6272 KB	Output isn't correct
44	Correct	63 ms	6400 KB	Output is correct
45	Incorrect	35 ms	6648 KB	Output isn't correct
46	Incorrect	36 ms	6784 KB	Output isn't correct
47	Correct	73 ms	6656 KB	Output is correct
48	Incorrect	39 ms	7040 KB	Output isn't correct
49	Incorrect	40 ms	7040 KB	Output isn't correct
50	Correct	84 ms	7040 KB	Output is correct
51	Incorrect	45 ms	7424 KB	Output isn't correct
52	Incorrect	45 ms	7416 KB	Output isn't correct
53	Correct	99 ms	7416 KB	Output is correct
54	Incorrect	52 ms	7800 KB	Output isn't correct
55	Incorrect	52 ms	7808 KB	Output isn't correct
56	Correct	117 ms	7808 KB	Output is correct
57	Incorrect	57 ms	8184 KB	Output isn't correct
58	Incorrect	58 ms	8184 KB	Output isn't correct
59	Correct	134 ms	8184 KB	Output is correct
60	Incorrect	68 ms	8568 KB	Output isn't correct
61	Incorrect	64 ms	8696 KB	Output isn't correct
62	Correct	159 ms	8568 KB	Output is correct
63	Incorrect	211 ms	8568 KB	Output isn't correct
64	Incorrect	244 ms	8696 KB	Output isn't correct
65	Incorrect	210 ms	8696 KB	Output isn't correct
66	Incorrect	207 ms	8568 KB	Output isn't correct
67	Incorrect	224 ms	8696 KB	Output isn't correct
68	Incorrect	154 ms	8700 KB	Output isn't correct
69	Correct	139 ms	8696 KB	Output is correct
70	Incorrect	142 ms	8696 KB	Output isn't correct
71	Incorrect	158 ms	8708 KB	Output isn't correct
72	Correct	194 ms	8696 KB	Output is correct
73	Correct	152 ms	9208 KB	Output is correct
74	Correct	201 ms	9336 KB	Output is correct
75	Incorrect	191 ms	9208 KB	Output isn't correct
76	Incorrect	193 ms	9180 KB	Output isn't correct
77	Incorrect	190 ms	9216 KB	Output isn't correct
78	Incorrect	223 ms	9252 KB	Output isn't correct
79	Correct	210 ms	9080 KB	Output is correct
80	Incorrect	195 ms	9208 KB	Output isn't correct
81	Incorrect	203 ms	9084 KB	Output isn't correct
82	Incorrect	209 ms	9260 KB	Output isn't correct
83	Incorrect	209 ms	9080 KB	Output isn't correct
84	Correct	215 ms	9080 KB	Output is correct
85	Incorrect	212 ms	9080 KB	Output isn't correct
86	Incorrect	198 ms	8952 KB	Output isn't correct
87	Correct	211 ms	8952 KB	Output is correct
88	Incorrect	191 ms	8956 KB	Output isn't correct
89	Correct	205 ms	9080 KB	Output is correct
90	Correct	215 ms	8952 KB	Output is correct
91	Correct	207 ms	8952 KB	Output is correct
92	Incorrect	209 ms	9100 KB	Output isn't correct