oj.uz

Submission #948893

# Submission time Handle Problem Language Result Execution time Memory
948893 2024-03-18T15:58:49 Z xynex Scales (IOI15_scales) C++17
0 / 100
 1000 ms 600 KB 
/**
  * Author: Tenjin
  * Created: 27.04.2022 18:58
  * Why am I so stupid? :c
  * Slishkom slab
**/
#include "scales.h"
#include <bits/stdc++.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 = 998244353;
const ll INF = 1e14;
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*/

const int N = 2e5 + 5;
const int M = 2e6 + 6;

void init(int T) {
}
void orderCoins() {
  vt<int> ord, ord1;
  int x = getLightest(1, 2, 3);
  int y = getMedian(1, 2, 3);
  int z = 1;
  if(x == z || y == z) z++;
  if(x == z || y == z) z++;
  ord = {x, y, z};
  x = getLightest(4, 5, 6);
  y = getMedian(4, 5, 6);
  z = 4;
  if(x == z || y == z) z++;
  if(x == z || y == z) z++;
  ord1 = {x, y, z};
  int arr[6] = {0};
  int l = 0, r = 0, pos = 0;
  while(l <= 1 || r <= 1) {
    if(l > 2 || r > 2) break;
    if(l <= 1) {
      int get = getLightest(ord[l], ord[l + 1], ord1[r]);
      if(get == ord[l]) {
        arr[pos++] = ord[l++];
      }
      else {
        arr[pos++] = ord1[r++];
      }
    }
    else if(r <= 1) {
      int get = getLightest(ord[l], ord1[r], ord1[r + 1]);
      if(get == ord[l]) {
        arr[pos++] = ord[l++];
      }
      else {
        arr[pos++] = ord1[r++];
      }
    }
  }
  if(l == 3) {
    while(pos < 6) arr[pos++] = ord1[r++];
  }
  else if(r == 3) {
    while(pos < 6) arr[pos] = ord[l++];
  }
  else {
    int get = getHeaviest(ord[l], ord1[r], arr[0]);
    if(get == ord[l]) arr[pos++] = ord1[r], arr[pos] = ord[l];
    else if(get == ord1[r]) arr[pos++] = ord[l], arr[pos] = ord1[r];
  }
  for(int i = 0; i < 6; ++i) write(arr[i], ' ');
  print("");
  //answer(arr);
}

Compilation message

scales.cpp: In function 'void init(int)':
scales.cpp:88:15: warning: unused parameter 'T' [-Wunused-parameter]
   88 | void init(int T) {
      |           ~~~~^
scales.cpp: In function 'void freop(std::string)':
scales.cpp:71:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
scales.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 + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Hacked.
2 Incorrect 0 ms 348 KB Hacked.
3 Incorrect 0 ms 348 KB Hacked.
4 Incorrect 0 ms 420 KB Hacked.
5 Incorrect 0 ms 348 KB Hacked.
6 Incorrect 0 ms 348 KB Hacked.
7 Incorrect 0 ms 348 KB Hacked.
8 Incorrect 0 ms 348 KB Hacked.
9 Incorrect 0 ms 348 KB Hacked.
10 Incorrect 0 ms 344 KB Hacked.
11 Incorrect 1 ms 348 KB Hacked.
12 Incorrect 1 ms 344 KB Hacked.
13 Incorrect 0 ms 348 KB Hacked.
14 Incorrect 0 ms 348 KB Hacked.
15 Incorrect 0 ms 348 KB Hacked.
16 Execution timed out 1046 ms 344 KB Time limit exceeded
17 Incorrect 0 ms 348 KB Hacked.
18 Incorrect 1 ms 348 KB Hacked.
19 Incorrect 0 ms 348 KB Hacked.
20 Incorrect 0 ms 348 KB Hacked.
21 Incorrect 0 ms 348 KB Hacked.
22 Incorrect 0 ms 348 KB Hacked.
23 Incorrect 0 ms 344 KB Hacked.
24 Incorrect 1 ms 348 KB Hacked.
25 Incorrect 1 ms 348 KB Hacked.
26 Incorrect 0 ms 344 KB Hacked.
27 Incorrect 0 ms 348 KB Hacked.
28 Incorrect 0 ms 348 KB Hacked.
29 Incorrect 0 ms 436 KB Hacked.
30 Incorrect 1 ms 348 KB Hacked.
31 Incorrect 0 ms 348 KB Hacked.
32 Incorrect 0 ms 348 KB Hacked.
33 Incorrect 0 ms 348 KB Hacked.
34 Incorrect 0 ms 348 KB Hacked.
35 Incorrect 0 ms 432 KB Hacked.
36 Execution timed out 1060 ms 348 KB Time limit exceeded
37 Incorrect 0 ms 348 KB Hacked.
38 Execution timed out 1082 ms 348 KB Time limit exceeded
39 Incorrect 0 ms 600 KB Hacked.
40 Execution timed out 1047 ms 348 KB Time limit exceeded