Submission #867456

#TimeUsernameProblemLanguageResultExecution timeMemory
867456ioi_alenparentrises (BOI18_parentrises)C++14
0 / 100
1 ms348 KiB
#include <iostream>
#include <string>
#include <regex>
using namespace std;




void solve_P1(string& s) {


    int n = s.length();
//    int d[n][2];

//    for (int i = 0; i < n + 1; i += 1) {
//        for (int j = 0; j < 2; j += 1) {
//            d[i][j] = 0;
//        }
//    }
//
//    d[0][0] = 0;
//    d[0][1] = 1;
//
//    for (int i = 0; i < n; i += 1) {
//        if (s[i] == '(') {
//            d[i + 1][0] = d[i][0] + 1;
//            d[i+ 1][1] = d[i][0] + 1;
//        }
//    }





     cout << s << endl;
}


void solve_P2(int N) {
    cout << N << endl;
}

int main() {

    int P;
    cin >> P;
    int N;
    cin >> N;

    for (int i = 0; i < N; i += 1) {
        if (P == 1) {
            string str;
            getline(cin, str);
            solve_P1(str);
         } else {
            int size;
            cin >> size;
            solve_P2(size);
        }
    }

    return 0;
}

Compilation message (stderr)

parentrises.cpp: In function 'void solve_P1(std::string&)':
parentrises.cpp:12:9: warning: unused variable 'n' [-Wunused-variable]
   12 |     int n = s.length();
      |         ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...