oj.uz

Submission #637442

# Submission time Handle Problem Language Result Execution time Memory
637442 2022-09-01T18:42:36 Z Carmel_Ab1 Zagrade (COI20_zagrade) C++17
100 / 100
 877 ms 940 KB 
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p){is >> p.first >> p.second;return is;}
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1, T2>& p){os <<"" << p.first << " " << p.second << ""; return os;}
void usaco(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}
template<typename T>
void read(vector<T>& v){
    int n=v.size();
    for(int i=0; i<n; i++)
        cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
    vector<T>ans;
    for(T t:a)
        if(ans.empty() || t!=ans.back())
            ans.push_back(t);
    return ans;
}



void solve();
int main(){
    GLHF;
    int t=1;
    //cin >> t;
    while(t--)
        solve();
}

bool ask(int l,int r){
    cout << "? " << l << " " << r << endl;
    int ans;
    cin >> ans;
    if(ans)return 1;
    else return 0;
}


void solve() {
    int n,q;
    cin >> n >> q;

    stack<int>S;
    string ans(n+1,' ');


    S.push(1);

    for(int i=2; i<=n; i++){
        if(S.size() && ask(S.top(),i))
            ans[S.top()]='(',ans[i]=')',S.pop();
        else
            S.push(i);
    }

    int sz=S.size();
    while(S.size()>sz/2)
        ans[S.top()]='(',S.pop();
    while(S.size())
        ans[S.top()]=')',S.pop();
    cout << "! " << ans.substr(1,n) << endl;
}

Compilation message

zagrade.cpp: In function 'void solve()':
zagrade.cpp:103:19: warning: comparison of integer expressions of different signedness: 'std::stack<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  103 |     while(S.size()>sz/2)
      |           ~~~~~~~~^~~~~
zagrade.cpp: In function 'void usaco(std::string)':
zagrade.cpp:47:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
zagrade.cpp:48:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 4 ms 320 KB Output is correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 8 ms 312 KB Output is correct
5 Correct 6 ms 316 KB Output is correct
6 Correct 8 ms 208 KB Output is correct
7 Correct 8 ms 208 KB Output is correct
8 Correct 9 ms 208 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 8 ms 320 KB Output is correct
3 Correct 8 ms 316 KB Output is correct
4 Correct 10 ms 316 KB Output is correct
5 Correct 9 ms 208 KB Output is correct
6 Correct 9 ms 208 KB Output is correct
7 Correct 11 ms 208 KB Output is correct
8 Correct 8 ms 308 KB Output is correct

Subtask #3
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 241 ms 524 KB Output is correct
3 Correct 758 ms 524 KB Output is correct
4 Correct 755 ms 520 KB Output is correct
5 Correct 781 ms 524 KB Output is correct
6 Correct 787 ms 552 KB Output is correct
7 Correct 877 ms 788 KB Output is correct
8 Correct 664 ms 524 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 861 ms 796 KB Output is correct
3 Correct 850 ms 652 KB Output is correct
4 Correct 431 ms 812 KB Output is correct
5 Correct 622 ms 940 KB Output is correct
6 Correct 716 ms 704 KB Output is correct
7 Correct 671 ms 872 KB Output is correct
8 Correct 793 ms 520 KB Output is correct