oj.uz

Submission #1005374

# Submission time Handle Problem Language Result Execution time Memory
1005374 2024-06-22T11:23:56 Z YassineBenYounes Homework (CEOI22_homework) C++17
13 / 100
 29 ms 15588 KB 
#include<bits/stdc++.h>
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<int, null_type, less<int>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
////////////////////Only Clear Code//////////////////////////

void usaco_problem(){
    freopen("milkvisits.in", "r", stdin);
    freopen("milkvisits.out", "w", stdout);
}

void init(){
    #ifndef ONLINE_JUDGE
 
freopen("input.txt", "r", stdin);
 
freopen("output.txt", "w", stdout);
 
#endif // ONLINE_JUDGE
}
//#define int ll
const int mx = 2e5+5;
const int LOG = 25;
const int inf = 1e9;
const ll mod = 998244353;

ll arr[mx];

int solve(int value, string s, int l, int r){
    if(s[0] == '?'){

    }
    else{

    }
}

void run_case(){
    string s;cin >> s;
    int c = 0;
    for(char x : s){
        if(x == '?')c++;
    }
    if(s.size() == 1){
        cout << c << endl;
        return;
    }
    string ch = "min", ch1 = "max";
    if(s[1] == 'a')ch = "max", ch1 = "min";
    for(int i = 0; i+2 < s.size();i++){
        //cout << i << endl;
        if(s[i] == ch[0] && s[i+1] == ch[1] && s[i+2] == ch[2]){
            c--;
        }
        if(s[i] == ch1[0] && s[i+1] == ch1[1] && s[i+2] == ch1[2]){
            int j = i+4;
            int cnt = 1;
            while(cnt > 0 && j < s.size()-2){
                if(s[j] == '(')cnt++;
                if(s[j] == ')')cnt--;
                j++;
            }
            i = j;
        }
    }
    cout << c << endl;
}

int main(){
    speed;
    int t = 1;
    //cin >> t;
    while(t--){
        run_case();
    }
}

/*
    NEVER GIVE UP!
    DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
    Your Guide when stuck:
    - Continue keyword only after reading the whole input
    - Don't use memset with testcases
    - Check for corner cases(n=1, n=0)
    - Check where you declare n(Be careful of declaring it globally and in main)
*/

Compilation message

Main.cpp: In function 'int solve(int, std::string, int, int)':
Main.cpp:61:1: warning: no return statement in function returning non-void [-Wreturn-type]
   61 | }
      | ^
Main.cpp: In function 'void run_case()':
Main.cpp:75:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     for(int i = 0; i+2 < s.size();i++){
      |                    ~~~~^~~~~~~~~~
Main.cpp:83:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |             while(cnt > 0 && j < s.size()-2){
      |                              ~~^~~~~~~~~~~~
Main.cpp: In function 'void usaco_problem()':
Main.cpp:33:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     freopen("milkvisits.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:34:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |     freopen("milkvisits.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'void init()':
Main.cpp:40:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:42:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 14664 KB Output is correct
2 Correct 25 ms 14552 KB Output is correct
3 Correct 29 ms 14808 KB Output is correct
4 Correct 29 ms 14032 KB Output is correct
5 Correct 28 ms 15588 KB Output is correct
6 Correct 26 ms 14052 KB Output is correct
7 Correct 29 ms 14040 KB Output is correct
8 Correct 26 ms 14540 KB Output is correct
9 Correct 26 ms 15184 KB Output is correct
10 Correct 29 ms 14172 KB Output is correct
11 Correct 28 ms 14052 KB Output is correct
12 Correct 29 ms 14804 KB Output is correct
13 Correct 0 ms 348 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 34.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -