oj.uz

Submission #752192

# Submission time Handle Problem Language Result Execution time Memory
752192 2023-06-02T13:00:48 Z Sam_a17 Ancient Machine (JOI21_ancient_machine) C++17
5 / 100
 96 ms 11072 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 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(unsigned long long t) {cerr << t;}
// void print(long double t) {cerr << t;}
 
// 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> void print(T v[],T n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} 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(deque <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, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// #define nl '\n'

// // 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 != "") {
//     freopen((str + ".in").c_str(), "r", stdin);
//     freopen((str + ".out").c_str(), "w", stdout);
//   } else {
//     // freopen("input.txt", "r", stdin);
//     // freopen("output.txt", "w", stdout);
//   }
// }
 
// // Indexed Set
// template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

void Send(int a);

void Anna(int N, std::vector<char> S) {
  Send(0);
  for(int i = 0; i < N; i++) {
    if(S[i] == 'X') {
      Send(0);
    } else if(S[i] == 'Y') {
      Send(1);
      Send(0);
    } else {
      Send(1);
      Send(1);
      Send(0);
    }
  }
}


#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(x) __builtin_popcount(x)
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
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;}
 
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(deque <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, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// 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 != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

void Remove(int d);

void Bruno(int N, int L, std::vector<int> A) {
  vector<int> a;
  for(int i = 0; i < L - 1; i++) {
    assert(A[i] == 0);

    int j = i + 1, cnt = 0;
    while(j < L && A[j] == 1) {
      j++, cnt++;
    }
    
    if(cnt == 0) {
      a.push_back(0);
    } else if(cnt == 1) {
      a.push_back(1);
    } else {
      a.push_back(2);
    }

    i = j - 1;
  }

  set<int> st[3];
  vector<bool> have(N);

  auto dll = [&](int l, int r)-> void {
    for(int i = 0; i < 3; i++) {
      auto it = st[i].lower_bound(l);
      vector<int> to_del;
      while(it != st[i].end() && *it < r) {
        to_del.push_back(*it);
        it = next(it);
      }

      for(auto j: to_del) {
        have[j] = true;
        Remove(j);
        st[i].erase(j);
      }
    }
  };

  int cnt = 0;
  for (int i = 0; i < N; i++) {
    int ok = 0;
    if(a[i] == 2) {
      while(!st[1].empty() && !st[0].empty()) {
        auto itr = *st[1].rbegin();
        auto itl = *st[0].begin();

        if(itl < itr) {
          dll(itr + 1, i);
          itl = *st[0].rbegin();
          dll(itl + 1, itr);

          //
          st[1].erase(itr);
          Remove(itr);
          have[itr] = true;
          cnt++;
          ok = 1;
        } else {
          break;
        }
      }
    }

    st[a[i]].insert(i);
  }

  for(int i = 0; i < 3; i++) {
    for(auto j: st[i]) {
      Remove(j);
    }
  }
}

Compilation message

Bruno.cpp: In function 'void Bruno(int, int, std::vector<int>)':
Bruno.cpp:118:9: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
  118 |     int ok = 0;
      |         ^~
Bruno.cpp: In function 'void setIO(std::string)':
Bruno.cpp:66:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Bruno.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 504 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 0 ms 504 KB Output is correct
4 Correct 2 ms 508 KB Output is correct
5 Correct 0 ms 516 KB Output is correct
6 Correct 1 ms 520 KB Output is correct
7 Correct 0 ms 512 KB Output is correct
8 Correct 1 ms 520 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 0 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct

Subtask #2
0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 91 ms 11020 KB Partially correct
2 Partially correct 96 ms 11072 KB Partially correct
3 Incorrect 9 ms 2292 KB Wrong Answer [2]
4 Halted 0 ms 0 KB -