oj.uz

Submission #771111

# Submission time Handle Problem Language Result Execution time Memory
771111 2023-07-02T13:02:08 Z Sam_a17 Crossing (JOI21_crossing) C++17
3 / 100
 7000 ms 5680 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long

void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// Indexed Set  
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
// template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(Tree <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
 

// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  } else if(str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}

int n;
string s[3];

set<string> all;

string cross(string &a, string &b) {
  string res = "";
  for(int i = 0; i < n; i++) {
    if(a[i] == b[i]) {
      res += a[i];
    } else {
      set<char> st;
      
      st.insert('J');
      st.insert('O');
      st.insert('I');

      st.erase(a[i]);
      st.erase(b[i]);
      res += *st.begin();
    }
  }

  return res;
}

void solve_() {
  cin >> n;

  for(int i = 0; i < 3; i++) {
    cin >> s[i];
  }

  all.insert(s[0]);

  int q; cin >> q;

  string k; cin >> k;
  if(all.find(k) != all.end()) {
    cout << "Yes" << '\n';
  } else {
    cout << "No" << '\n';
  }
  while(q--) {
    int l, r;
    char ch;
    cin >> l >> r >> ch;
    l--, r--;
    for(int i = l; i <= r; i++) {
      k[i] = ch;
    }

    if(all.find(k) != all.end()) {
      cout << "Yes" << '\n';
    } else {
      cout << "No" << '\n';
    }
  }
}

int main() {
  setIO();

  auto solve = [&](int test_case)-> void {
    for(int i = 1; i <= test_case; i++) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

Main.cpp: In function 'void setIO(std::string)':
Main.cpp:76:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:77:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:79:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:80:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2224 KB Output is correct
2 Correct 35 ms 2452 KB Output is correct
3 Correct 45 ms 2260 KB Output is correct
4 Correct 34 ms 2312 KB Output is correct
5 Correct 34 ms 2348 KB Output is correct
6 Correct 33 ms 2200 KB Output is correct
7 Correct 33 ms 2364 KB Output is correct
8 Correct 36 ms 2396 KB Output is correct
9 Correct 35 ms 2380 KB Output is correct
10 Correct 35 ms 2428 KB Output is correct
11 Correct 35 ms 2352 KB Output is correct
12 Correct 44 ms 2340 KB Output is correct
13 Correct 35 ms 2340 KB Output is correct
14 Correct 36 ms 2504 KB Output is correct
15 Correct 35 ms 2320 KB Output is correct
16 Correct 36 ms 2392 KB Output is correct
17 Correct 35 ms 2400 KB Output is correct
18 Correct 45 ms 2284 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2224 KB Output is correct
2 Correct 35 ms 2452 KB Output is correct
3 Correct 45 ms 2260 KB Output is correct
4 Correct 34 ms 2312 KB Output is correct
5 Correct 34 ms 2348 KB Output is correct
6 Correct 33 ms 2200 KB Output is correct
7 Correct 33 ms 2364 KB Output is correct
8 Correct 36 ms 2396 KB Output is correct
9 Correct 35 ms 2380 KB Output is correct
10 Correct 35 ms 2428 KB Output is correct
11 Correct 35 ms 2352 KB Output is correct
12 Correct 44 ms 2340 KB Output is correct
13 Correct 35 ms 2340 KB Output is correct
14 Correct 36 ms 2504 KB Output is correct
15 Correct 35 ms 2320 KB Output is correct
16 Correct 36 ms 2392 KB Output is correct
17 Correct 35 ms 2400 KB Output is correct
18 Correct 45 ms 2284 KB Output is correct
19 Correct 3245 ms 5680 KB Output is correct
20 Execution timed out 7032 ms 3480 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2224 KB Output is correct
2 Correct 35 ms 2452 KB Output is correct
3 Correct 45 ms 2260 KB Output is correct
4 Correct 34 ms 2312 KB Output is correct
5 Correct 34 ms 2348 KB Output is correct
6 Correct 33 ms 2200 KB Output is correct
7 Correct 33 ms 2364 KB Output is correct
8 Correct 36 ms 2396 KB Output is correct
9 Correct 35 ms 2380 KB Output is correct
10 Correct 35 ms 2428 KB Output is correct
11 Correct 35 ms 2352 KB Output is correct
12 Correct 44 ms 2340 KB Output is correct
13 Correct 35 ms 2340 KB Output is correct
14 Correct 36 ms 2504 KB Output is correct
15 Correct 35 ms 2320 KB Output is correct
16 Correct 36 ms 2392 KB Output is correct
17 Correct 35 ms 2400 KB Output is correct
18 Correct 45 ms 2284 KB Output is correct
19 Correct 34 ms 2256 KB Output is correct
20 Correct 45 ms 2208 KB Output is correct
21 Incorrect 44 ms 2372 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2224 KB Output is correct
2 Correct 35 ms 2452 KB Output is correct
3 Correct 45 ms 2260 KB Output is correct
4 Correct 34 ms 2312 KB Output is correct
5 Correct 34 ms 2348 KB Output is correct
6 Correct 33 ms 2200 KB Output is correct
7 Correct 33 ms 2364 KB Output is correct
8 Correct 36 ms 2396 KB Output is correct
9 Correct 35 ms 2380 KB Output is correct
10 Correct 35 ms 2428 KB Output is correct
11 Correct 35 ms 2352 KB Output is correct
12 Correct 44 ms 2340 KB Output is correct
13 Correct 35 ms 2340 KB Output is correct
14 Correct 36 ms 2504 KB Output is correct
15 Correct 35 ms 2320 KB Output is correct
16 Correct 36 ms 2392 KB Output is correct
17 Correct 35 ms 2400 KB Output is correct
18 Correct 45 ms 2284 KB Output is correct
19 Correct 3245 ms 5680 KB Output is correct
20 Execution timed out 7032 ms 3480 KB Time limit exceeded
21 Halted 0 ms 0 KB -