답안 #115740

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
115740	2019-06-08T19:58:14 Z	Breno_XD	Retro (COCI17_retro)	C++14	5 / 100	500 ms	512 KB

retro

#include <bits/stdc++.h>

using namespace std;

#define MAX 310

string seq, ans;
int r, s, x, y;
char v[MAX][MAX];

bool valid(int i, int j){
    if(i >= 0 && i <= r && j >= 1 && j <= s)return true;
    return false;
}

void dfs(int i, int j){

    if(v[i][j] == '*' || (i < 1 && j >= 1 && j <= s)){

        stack<char> pilha;

        bool ok = true;
        for(int i = 0; i < seq.size(); i++){
            if(seq[i] == '('){
                pilha.push('(');
            }else if(seq[i] == ')'){
                if(pilha.size() > 0){
                    pilha.pop();
                }else{
                    ok = false;
                    break;
                }
            }
        }

        if(pilha.size() > 0) ok = false;

        if(ok && seq.size() > ans.size()){
            ans = seq;
        }else if(ok && seq.size() == ans.size()){
            for(int i = 0; i < seq.size(); i++){
                if(ans[i] == ')' && seq[i] == '('){
                    ans = seq;
                    break;
                }
            }
        }
        return;
    }

    seq += v[i][j];

    if(valid(i-1, j-1)){
        int tmp = seq.size();
        dfs(i-1, j-1);
        if(seq.size() > tmp)
            seq.erase(seq.begin()+seq.size()-1);
    }
    if(i-1, j){
        int tmp = seq.size();
        dfs(i-1, j);
        if(seq.size() > tmp)
            seq.erase(seq.begin()+seq.size()-1);
    }
    if(valid(i-1, j+1)){
        int tmp = seq.size();
        dfs(i-1, j+1);
        if(seq.size() > tmp)
            seq.erase(seq.begin()+seq.size()-1);
    }

    return;

}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    cin >> r >> s;
    for(int i = 1; i <= r; i++){
        for(int j = 1; j <= s; j++){
            cin >> v[i][j];
            if(v[i][j] == 'M'){
                x = i; y = j;
            }
        }
    }
    dfs(x, y);
    string ans2 = "";
    for(int i = 0; i < ans.size(); i++){
        if(ans[i] == '(' || ans[i] == ')'){
            ans2 += ans[i];
        }
    }
    cout << ans2.size() << "\n";
    cout << ans2 << "\n";
    /*
    for(int i = 0; i < ans2.size(); i++){
        cout << ans2[i] << " ";
    }
    cout << "\n";
    */
    return 0;
}

Compilation message

retro.cpp: In function 'void dfs(int, int)':
retro.cpp:23:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < seq.size(); i++){
                        ~~^~~~~~~~~~~~
retro.cpp:41:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0; i < seq.size(); i++){
                            ~~^~~~~~~~~~~~
retro.cpp:56:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(seq.size() > tmp)
            ~~~~~~~~~~~^~~~~
retro.cpp:59:9: warning: left operand of comma operator has no effect [-Wunused-value]
     if(i-1, j){
        ~^~
retro.cpp:62:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(seq.size() > tmp)
            ~~~~~~~~~~~^~~~~
retro.cpp:68:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(seq.size() > tmp)
            ~~~~~~~~~~~^~~~~
retro.cpp: In function 'int main()':
retro.cpp:91:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < ans.size(); i++){
                    ~~^~~~~~~~~~~~

Subtask #1

5.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Incorrect	47 ms	384 KB	Output isn't correct
3	Incorrect	331 ms	384 KB	Output isn't correct
4	Execution timed out	521 ms	376 KB	Time limit exceeded
5	Incorrect	351 ms	504 KB	Output isn't correct
6	Execution timed out	1060 ms	384 KB	Time limit exceeded
7	Execution timed out	1075 ms	384 KB	Time limit exceeded
8	Execution timed out	1074 ms	384 KB	Time limit exceeded
9	Execution timed out	1073 ms	384 KB	Time limit exceeded
10	Execution timed out	1072 ms	384 KB	Time limit exceeded
11	Execution timed out	1070 ms	512 KB	Time limit exceeded
12	Execution timed out	1076 ms	512 KB	Time limit exceeded
13	Execution timed out	1069 ms	512 KB	Time limit exceeded
14	Execution timed out	1068 ms	512 KB	Time limit exceeded
15	Execution timed out	1084 ms	512 KB	Time limit exceeded
16	Execution timed out	1074 ms	512 KB	Time limit exceeded
17	Execution timed out	1085 ms	512 KB	Time limit exceeded
18	Execution timed out	1077 ms	512 KB	Time limit exceeded
19	Execution timed out	1074 ms	512 KB	Time limit exceeded
20	Execution timed out	1071 ms	512 KB	Time limit exceeded