oj.uz

Submission #915107

# Submission time Handle Problem Language Result Execution time Memory
915107 2024-01-23T11:03:45 Z xynex Carnival Tickets (IOI20_tickets) C++17
100 / 100
 646 ms 107172 KB 
/**
  * Author: Tenjin
  * Created: 27.04.2022 18:58
  * Why am I so stupid? :c
  * Slishkom slab
**/
#include "tickets.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 = 1e9 + 7;
const ll INF = 1e14;
const int M = 2e5 + 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*/


ll find_maximum(int k, vt<vt<int>> a) {
  int n = sz(a);
  int m = sz(a[0]);
  vt<pr<ll, int> > st;
  ll sum = 0;
  for(int i = 0; i < n; ++i) {
    for(int j = 0; j < k; ++j) {
      sum -= a[i][j];
      st.pb({a[i][j] + a[i][m - k + j], i});
    }
  }
  sort(rall(st));
  vt<int> cnt(n);
  for(int i = 0; i < n * k / 2; ++i) {
    sum += st[i].ff;
    cnt[st[i].ss]++;
  }
  vt<vt<int>> ans(n, vt<int> (m, -1));
  int ps = 0;
  for(int i = 0; i < n; ++i) {
    for(int j = 0; j < k - cnt[i]; ++j) {
      ans[i][j] = ps++;
      ps %= k;
    }
    int x = ps;
    for(int j = 0; j < cnt[i]; ++j) {
      ans[i][m - cnt[i] + j] = x++;
      x %= k;
    }
  }
  allocate_tickets(ans);
  return sum;
}

Compilation message

tickets.cpp: In function 'void freop(std::string)':
tickets.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);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
tickets.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 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 424 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 1012 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 18 ms 2512 KB Output is correct
6 Correct 391 ms 51540 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 444 KB Output is correct
5 Correct 16 ms 3004 KB Output is correct
6 Correct 409 ms 68264 KB Output is correct
7 Correct 426 ms 73372 KB Output is correct
8 Correct 4 ms 860 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1004 KB Output is correct
13 Correct 15 ms 2776 KB Output is correct
14 Correct 15 ms 3028 KB Output is correct
15 Correct 431 ms 77288 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 24 ms 4288 KB Output is correct
6 Correct 4 ms 988 KB Output is correct
7 Correct 6 ms 1224 KB Output is correct
8 Correct 610 ms 106408 KB Output is correct
9 Correct 564 ms 104716 KB Output is correct
10 Correct 581 ms 104372 KB Output is correct
11 Correct 621 ms 105876 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 3 ms 600 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 3 ms 700 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 3 ms 600 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 3 ms 700 KB Output is correct
13 Correct 18 ms 3160 KB Output is correct
14 Correct 19 ms 3212 KB Output is correct
15 Correct 32 ms 3792 KB Output is correct
16 Correct 24 ms 4292 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 3 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 21 ms 3244 KB Output is correct
21 Correct 21 ms 3788 KB Output is correct
22 Correct 23 ms 3780 KB Output is correct
23 Correct 23 ms 4296 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 424 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 1012 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 500 KB Output is correct
11 Correct 18 ms 2512 KB Output is correct
12 Correct 391 ms 51540 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 444 KB Output is correct
17 Correct 16 ms 3004 KB Output is correct
18 Correct 409 ms 68264 KB Output is correct
19 Correct 426 ms 73372 KB Output is correct
20 Correct 4 ms 860 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 5 ms 1004 KB Output is correct
25 Correct 15 ms 2776 KB Output is correct
26 Correct 15 ms 3028 KB Output is correct
27 Correct 431 ms 77288 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 24 ms 4288 KB Output is correct
33 Correct 4 ms 988 KB Output is correct
34 Correct 6 ms 1224 KB Output is correct
35 Correct 610 ms 106408 KB Output is correct
36 Correct 564 ms 104716 KB Output is correct
37 Correct 581 ms 104372 KB Output is correct
38 Correct 621 ms 105876 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 2 ms 600 KB Output is correct
41 Correct 3 ms 600 KB Output is correct
42 Correct 3 ms 604 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 3 ms 600 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 2 ms 604 KB Output is correct
48 Correct 2 ms 604 KB Output is correct
49 Correct 2 ms 604 KB Output is correct
50 Correct 3 ms 700 KB Output is correct
51 Correct 18 ms 3160 KB Output is correct
52 Correct 19 ms 3212 KB Output is correct
53 Correct 32 ms 3792 KB Output is correct
54 Correct 24 ms 4292 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 3 ms 604 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 21 ms 3244 KB Output is correct
59 Correct 21 ms 3788 KB Output is correct
60 Correct 23 ms 3780 KB Output is correct
61 Correct 23 ms 4296 KB Output is correct
62 Correct 46 ms 8472 KB Output is correct
63 Correct 47 ms 8440 KB Output is correct
64 Correct 65 ms 11708 KB Output is correct
65 Correct 227 ms 37924 KB Output is correct
66 Correct 271 ms 45480 KB Output is correct
67 Correct 5 ms 1240 KB Output is correct
68 Correct 6 ms 988 KB Output is correct
69 Correct 401 ms 73088 KB Output is correct
70 Correct 535 ms 85616 KB Output is correct
71 Correct 646 ms 107172 KB Output is correct
72 Correct 571 ms 92260 KB Output is correct
73 Correct 592 ms 96420 KB Output is correct
74 Correct 483 ms 71852 KB Output is correct
75 Correct 498 ms 83404 KB Output is correct