oj.uz

Submission #600398

# Submission time Handle Problem Language Result Execution time Memory
600398 2022-07-20T19:55:30 Z xynex Xylophone (JOI18_xylophone) C++17
100 / 100
 119 ms 448 KB 
/**
  * Author: Tenjin
  * Created: 28.06.2022 14:48
  * Why am I so stupid? :c
  * Slishkom slab
**/

#include <bits/stdc++.h>
#include "xylophone.h"
// #pragma GCC optimize("inline")
// #pragma GCC optimize("-fgcse,-fgcse-lm")
// #pragma GCC optimize("-ftree-pre,-ftree-vrp")
// #pragma GCC optimize("-ffast-math")
// #pragma GCC optimize("-fipa-sra")
// #pragma GCC optimize("-fpeephole2")
// #pragma GCC optimize("-fsched-spec")
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")

using namespace std;

#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)

template<typename T> T get_rand(T l, T r) {
  random_device rd;
  mt19937 gen(rd());
  return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const ll INF = 9e18;
const int M = 2e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/


static const int N_MAX = 5000;

int ANS[N_MAX], X[N_MAX], Y[N_MAX];
void solve(int N) {
  for(int i = 1; i < N; ++i) {
    X[i] = query(i, i + 1);
    //write(X[i], ' ');
  }
  //print("");
  for(int i = 2; i < N; ++i) {
    Y[i - 1] = query(i - 1, i + 1);
    //write(Y[i - 1], ' ');
  }
  //print("");
  bool ok = 1;
  ANS[2] = X[1];
  for(int i = 2; i < N; ++i) {
    if(X[i - 1] + X[i] != Y[i - 1]) {
      ok ^= 1;
    }
    ANS[i + 1] = ANS[i] + X[i] * ((int)ok * 2 - 1);
  }
  int mx = 0, pos1 = 0, mn = 0, pos2 = 0;
  for(int i = 1; i <= N; ++i) {
    if(ANS[i] > mx) {
      mx = ANS[i];
      pos1 = i;
    }
    else if(ANS[i] < mn) {
      mn = ANS[i];
      pos2 = i;
    }
  }
  if(pos1 < pos2) {
    for(int i = 1; i <= N; ++i) {
      answer(i, mx - ANS[i] + 1);
    }
  }
  else {
    for(int i = 1; i <= N; ++i) {
      answer(i, ANS[i] - mn + 1);
    }
  }
}

Compilation message

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 3 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 3 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 4 ms 308 KB Output is correct
17 Correct 8 ms 304 KB Output is correct
18 Correct 18 ms 304 KB Output is correct
19 Correct 12 ms 304 KB Output is correct
20 Correct 11 ms 208 KB Output is correct
21 Correct 11 ms 308 KB Output is correct
22 Correct 14 ms 304 KB Output is correct
23 Correct 15 ms 288 KB Output is correct
24 Correct 15 ms 208 KB Output is correct
25 Correct 20 ms 208 KB Output is correct
26 Correct 18 ms 308 KB Output is correct
27 Correct 17 ms 304 KB Output is correct
28 Correct 13 ms 208 KB Output is correct
29 Correct 13 ms 208 KB Output is correct
30 Correct 14 ms 308 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 3 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 4 ms 308 KB Output is correct
17 Correct 8 ms 304 KB Output is correct
18 Correct 18 ms 304 KB Output is correct
19 Correct 12 ms 304 KB Output is correct
20 Correct 11 ms 208 KB Output is correct
21 Correct 11 ms 308 KB Output is correct
22 Correct 14 ms 304 KB Output is correct
23 Correct 15 ms 288 KB Output is correct
24 Correct 15 ms 208 KB Output is correct
25 Correct 20 ms 208 KB Output is correct
26 Correct 18 ms 308 KB Output is correct
27 Correct 17 ms 304 KB Output is correct
28 Correct 13 ms 208 KB Output is correct
29 Correct 13 ms 208 KB Output is correct
30 Correct 14 ms 308 KB Output is correct
31 Correct 37 ms 308 KB Output is correct
32 Correct 51 ms 312 KB Output is correct
33 Correct 74 ms 304 KB Output is correct
34 Correct 69 ms 304 KB Output is correct
35 Correct 56 ms 432 KB Output is correct
36 Correct 99 ms 312 KB Output is correct
37 Correct 82 ms 320 KB Output is correct
38 Correct 79 ms 304 KB Output is correct
39 Correct 89 ms 436 KB Output is correct
40 Correct 90 ms 448 KB Output is correct
41 Correct 80 ms 304 KB Output is correct
42 Correct 87 ms 436 KB Output is correct
43 Correct 81 ms 308 KB Output is correct
44 Correct 81 ms 304 KB Output is correct
45 Correct 87 ms 320 KB Output is correct
46 Correct 74 ms 312 KB Output is correct
47 Correct 84 ms 320 KB Output is correct
48 Correct 93 ms 420 KB Output is correct
49 Correct 40 ms 336 KB Output is correct
50 Correct 69 ms 384 KB Output is correct
51 Correct 119 ms 308 KB Output is correct
52 Correct 93 ms 328 KB Output is correct
53 Correct 94 ms 436 KB Output is correct
54 Correct 85 ms 332 KB Output is correct
55 Correct 92 ms 320 KB Output is correct
56 Correct 98 ms 328 KB Output is correct
57 Correct 78 ms 328 KB Output is correct
58 Correct 80 ms 308 KB Output is correct
59 Correct 62 ms 424 KB Output is correct
60 Correct 95 ms 308 KB Output is correct