Submission #491628

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
491628	2021-12-03T14:55:52 Z	acm	Weighting stones (IZhO11_stones)	C++14	0 / 100	1000 ms	3160 KB

stones

#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif
#include <bits/stdc++.h>
#define speed                   \
  ios_base::sync_with_stdio(0); \
  cin.tie(0);                   \
  cout.tie(0);
#define precision     \
  cout.precision(30); \
  cerr.precision(10);
#define ll long long
#define ld long double
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void ioi(string name) {
  freopen((name + ".in").c_str(), "r", stdin);
  freopen((name + ".out").c_str(), "w", stdout);
}
int q, n, m, h[100005];
set<int> a, b, A, B;
void lol() {
  while (sz(A) && sz(B)) {
    int v = *prev(A.end());
    a.insert(v);
    A.erase(v);
    h[v]++;
    v = *prev(B.end());
    b.insert(v);
    B.erase(v);
    h[v]--;
  }
}
void add(int x) {
  n++;
  A.insert(x);
  lol();
  while (sz(a) && sz(A) && (*a.begin() < *prev(A.end()))) {
    int v = *a.begin();
    a.erase(v);
    A.insert(v);
    h[v]--;
    v = *prev(A.end());
    a.insert(v);
    A.erase(v);
    h[v]++;
  }
}
void dda(int x) {
  m++;
  B.insert(x);
  lol();
  while (sz(b) && sz(B) && (*b.begin() < *prev(B.end()))) {
    int v = *b.begin();
    b.erase(v);
    B.insert(v);
    h[v]++;
    v = *prev(B.end());
    b.insert(v);
    B.erase(v);
    h[v]--;
  }
}
int get() {
  int x = 1, y = 1, s = 0;
  for (int i = q; i >= 1; i--) {
    s += h[i];
    x &= (0 <= s);
    y &= (s <= 0);
    if (!x && !y) break;
  }
  if (!x && !y) return -1;
  if (x && y) return n > m;
  if (x && n != max(n, m)) return -1;
  if (y && m != max(n, m)) return -1;
  return x;
}
int main() {
  speed;
  precision;
  // code
  cin >> q;
  for (int i = 1; i <= q; i++) {
    int x, y;
    cin >> x >> y;
    if (y < 2)
      add(x);
    else
      dda(x);
    x = get();
    if (x < 0)
      cout << "?\n";
    else
      cout << (x ? ">\n" : "<\n");
  }
  // endl
#ifndef ONLINE_JUDGE
  cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
  return 0;
}

Compilation message

stones.cpp: In function 'void ioi(std::string)':
stones.cpp:26:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |   freopen((name + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
stones.cpp:27:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |   freopen((name + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	22 ms	700 KB	Output is correct
11	Execution timed out	1087 ms	3160 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-