oj.uz

답안 #770927

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
770927 2023-07-02T07:04:56 Z horiiseun Xylophone (JOI18_xylophone) C++17
100 / 100
 92 ms 440 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include "xylophone.h"
using namespace std;

#define ll long long
#define f first
#define s second

void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }

template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);

template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}

template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}

template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}

template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}

template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}

template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}

void _print() { cerr << "]\n"; }

template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}

#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
	#define D(...)
#endif

void solve(int n) {
	vector<int> adj, tri;
	for (int i = 1; i < n; i++) { 
		adj.push_back(query(i, i + 1));
	}
	D(adj);
	for (int i = 1; i < n - 1; i++) {
		tri.push_back(query(i, i + 2));
	}
	D(tri);
	
	vector<int> v;
	v.push_back(0);
	v.push_back(adj[0]);
	for (int i = 0; i < tri.size(); i++) {
		if (tri[i] == adj[i] + adj[i + 1]) {
			v.push_back(v.back() / adj[i] * adj[i + 1]);
		} else {
			v.push_back(-v.back() / adj[i] * adj[i + 1]);
		}
	}
	D(v);
	
	int mn = 2e9, mx = 0, pref = 0, mnpos = 0, mxpos = 0;
	for (int i = 0; i < v.size(); i++) {
		pref += v[i];
		if (pref > mx) {
			mx = pref;
			mxpos = i;
		}
		if (pref < mn) {
			mn = pref;
			mnpos = i;
		}
	}
	D(mx);
	D(mn);

	if (mx + abs(mn) + 1 > n || mnpos >= mxpos) {
		for (int i = 0; i < v.size(); i++) {
			v[i] *= -1;
		}
	}
	D(v);
	mn = 0;
	for (int i = 1; i < v.size(); i++) {
		v[i] += v[i - 1];
		mn = min(v[i], mn);
	}

	for (int i = 0; i < v.size(); i++) {
		answer(i + 1, v[i] + abs(mn) + 1);
	}
	return;
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:129:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  129 |  for (int i = 0; i < tri.size(); i++) {
      |                  ~~^~~~~~~~~~~~
xylophone.cpp:139:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |  for (int i = 0; i < v.size(); i++) {
      |                  ~~^~~~~~~~~~
xylophone.cpp:154:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  154 |   for (int i = 0; i < v.size(); i++) {
      |                   ~~^~~~~~~~~~
xylophone.cpp:160:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  160 |  for (int i = 1; i < v.size(); i++) {
      |                  ~~^~~~~~~~~~
xylophone.cpp:165:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  165 |  for (int i = 0; i < v.size(); i++) {
      |                  ~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 288 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 304 KB Output is correct
8 Correct 2 ms 296 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 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 1 ms 208 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 288 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 304 KB Output is correct
8 Correct 2 ms 296 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 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 1 ms 208 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 9 ms 296 KB Output is correct
18 Correct 12 ms 304 KB Output is correct
19 Correct 18 ms 292 KB Output is correct
20 Correct 16 ms 208 KB Output is correct
21 Correct 16 ms 304 KB Output is correct
22 Correct 15 ms 288 KB Output is correct
23 Correct 18 ms 308 KB Output is correct
24 Correct 11 ms 208 KB Output is correct
25 Correct 17 ms 308 KB Output is correct
26 Correct 13 ms 208 KB Output is correct
27 Correct 12 ms 308 KB Output is correct
28 Correct 7 ms 300 KB Output is correct
29 Correct 10 ms 308 KB Output is correct
30 Correct 16 ms 208 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 288 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 304 KB Output is correct
8 Correct 2 ms 296 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 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 1 ms 208 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 9 ms 296 KB Output is correct
18 Correct 12 ms 304 KB Output is correct
19 Correct 18 ms 292 KB Output is correct
20 Correct 16 ms 208 KB Output is correct
21 Correct 16 ms 304 KB Output is correct
22 Correct 15 ms 288 KB Output is correct
23 Correct 18 ms 308 KB Output is correct
24 Correct 11 ms 208 KB Output is correct
25 Correct 17 ms 308 KB Output is correct
26 Correct 13 ms 208 KB Output is correct
27 Correct 12 ms 308 KB Output is correct
28 Correct 7 ms 300 KB Output is correct
29 Correct 10 ms 308 KB Output is correct
30 Correct 16 ms 208 KB Output is correct
31 Correct 36 ms 296 KB Output is correct
32 Correct 48 ms 300 KB Output is correct
33 Correct 55 ms 312 KB Output is correct
34 Correct 66 ms 312 KB Output is correct
35 Correct 80 ms 300 KB Output is correct
36 Correct 76 ms 328 KB Output is correct
37 Correct 54 ms 436 KB Output is correct
38 Correct 82 ms 312 KB Output is correct
39 Correct 69 ms 344 KB Output is correct
40 Correct 64 ms 328 KB Output is correct
41 Correct 78 ms 332 KB Output is correct
42 Correct 65 ms 296 KB Output is correct
43 Correct 84 ms 296 KB Output is correct
44 Correct 64 ms 336 KB Output is correct
45 Correct 64 ms 304 KB Output is correct
46 Correct 85 ms 308 KB Output is correct
47 Correct 77 ms 336 KB Output is correct
48 Correct 45 ms 440 KB Output is correct
49 Correct 83 ms 308 KB Output is correct
50 Correct 57 ms 336 KB Output is correct
51 Correct 61 ms 324 KB Output is correct
52 Correct 60 ms 316 KB Output is correct
53 Correct 74 ms 340 KB Output is correct
54 Correct 86 ms 308 KB Output is correct
55 Correct 70 ms 304 KB Output is correct
56 Correct 92 ms 336 KB Output is correct
57 Correct 52 ms 292 KB Output is correct
58 Correct 85 ms 312 KB Output is correct
59 Correct 84 ms 328 KB Output is correct
60 Correct 37 ms 412 KB Output is correct