oj.uz

답안 #223618

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
223618 2020-04-15T19:23:39 Z rqi Xylophone (JOI18_xylophone) C++14
100 / 100
 139 ms 640 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair 
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 

template<class T> bool ckmin(T& a, const T& b) { 
	return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
	return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bit(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
template<class A, class B> str ts(pair<A,B> p);
template<class A> str ts(complex<A> c) { return ts(mp(c.real(),c.imag())); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(char c) { str s = ""; s += c; return s; }
str ts(str s) { return s; }
str ts(const char* s) { return (str)s; }
str ts(vector<bool> v) { 
	bool fst = 1; str res = "{";
	F0R(i,sz(v)) {
		if (!fst) res += ", ";
		fst = 0; res += ts(v[i]);
	}
	res += "}"; return res;
}
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; F0R(i,SZ) res += char('0'+b[i]);
	return res; }
template<class T> str ts(T v) {
	bool fst = 1; str res = "{";
	for (const auto& x: v) {
		if (!fst) res += ", ";
		fst = 0; res += ts(x);
	}
	res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
	return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
	pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
	pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << to_string(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
	unsyncIO();
	// cin.exceptions(cin.failbit); 
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 


int A[5005];
int q1[5005];
int q2[5005];
bool sam[5005];
int upd[5005];
void solve(int N) {

	for(int i = 1; i <= N-1; i++){
		q1[i] = query(i, i+1);
	}
	for(int i = 1; i <= N-2; i++){
		q2[i] = query(i, i+2);
	}
	for(int i = 1; i <= N-2; i++){
		if(q1[i]+q1[i+1] == q2[i]){
			sam[i] = 1;
		}
		else sam[i] = 0;
	}
	upd[1] = 1;
	for(int i = 2; i <= N-1; i++){
		if(sam[i-1] == 0){
			upd[i] = -upd[i-1];
		}
		else upd[i] = upd[i-1];
	}

	for(int i = 1; i <= N-1; i++){
		int diff = q1[i]*upd[i];
		A[i+1] = A[i]+diff;
	}
	int mval = MOD;
	for(int i = 1; i <= N; i++){
		ckmin(mval, A[i]);
	}
	for(int i = 1; i <= N; i++){
		A[i] = A[i]-mval+1;
	}

	int pos1;
	int posN;
	for(int i = 1; i <= N; i++){
		if(A[i] == 1) pos1 = i;
		if(A[i] == N) posN = i;
	}
	if(pos1 > posN){
		for(int i = 1; i <= N; i++){
			A[i] = N+1-A[i];
		}
	}
	for(int i = 1; i <= N; i++) {
		answer(i, A[i]);
	}

}

Compilation message

xylophone.cpp: In function 'void setIn(std::__cxx11::string)':
xylophone.cpp:124:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
xylophone.cpp: In function 'void setOut(std::__cxx11::string)':
xylophone.cpp:125:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:183:2: warning: 'posN' may be used uninitialized in this function [-Wmaybe-uninitialized]
  if(pos1 > posN){
  ^~
xylophone.cpp:183:2: warning: 'pos1' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 7 ms 384 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 8 ms 384 KB Output is correct
11 Correct 7 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 7 ms 384 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 7 ms 384 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 8 ms 384 KB Output is correct
11 Correct 7 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 7 ms 384 KB Output is correct
16 Correct 8 ms 384 KB Output is correct
17 Correct 14 ms 384 KB Output is correct
18 Correct 25 ms 384 KB Output is correct
19 Correct 25 ms 508 KB Output is correct
20 Correct 32 ms 384 KB Output is correct
21 Correct 26 ms 384 KB Output is correct
22 Correct 31 ms 384 KB Output is correct
23 Correct 22 ms 384 KB Output is correct
24 Correct 20 ms 392 KB Output is correct
25 Correct 14 ms 548 KB Output is correct
26 Correct 31 ms 384 KB Output is correct
27 Correct 21 ms 384 KB Output is correct
28 Correct 26 ms 384 KB Output is correct
29 Correct 22 ms 384 KB Output is correct
30 Correct 26 ms 384 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 7 ms 384 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 8 ms 384 KB Output is correct
11 Correct 7 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 7 ms 384 KB Output is correct
16 Correct 8 ms 384 KB Output is correct
17 Correct 14 ms 384 KB Output is correct
18 Correct 25 ms 384 KB Output is correct
19 Correct 25 ms 508 KB Output is correct
20 Correct 32 ms 384 KB Output is correct
21 Correct 26 ms 384 KB Output is correct
22 Correct 31 ms 384 KB Output is correct
23 Correct 22 ms 384 KB Output is correct
24 Correct 20 ms 392 KB Output is correct
25 Correct 14 ms 548 KB Output is correct
26 Correct 31 ms 384 KB Output is correct
27 Correct 21 ms 384 KB Output is correct
28 Correct 26 ms 384 KB Output is correct
29 Correct 22 ms 384 KB Output is correct
30 Correct 26 ms 384 KB Output is correct
31 Correct 65 ms 384 KB Output is correct
32 Correct 51 ms 384 KB Output is correct
33 Correct 117 ms 504 KB Output is correct
34 Correct 102 ms 384 KB Output is correct
35 Correct 126 ms 504 KB Output is correct
36 Correct 82 ms 504 KB Output is correct
37 Correct 99 ms 508 KB Output is correct
38 Correct 113 ms 384 KB Output is correct
39 Correct 86 ms 504 KB Output is correct
40 Correct 129 ms 504 KB Output is correct
41 Correct 106 ms 384 KB Output is correct
42 Correct 123 ms 640 KB Output is correct
43 Correct 126 ms 384 KB Output is correct
44 Correct 98 ms 504 KB Output is correct
45 Correct 110 ms 384 KB Output is correct
46 Correct 129 ms 384 KB Output is correct
47 Correct 88 ms 504 KB Output is correct
48 Correct 121 ms 420 KB Output is correct
49 Correct 109 ms 504 KB Output is correct
50 Correct 132 ms 384 KB Output is correct
51 Correct 129 ms 632 KB Output is correct
52 Correct 93 ms 516 KB Output is correct
53 Correct 126 ms 504 KB Output is correct
54 Correct 120 ms 516 KB Output is correct
55 Correct 88 ms 384 KB Output is correct
56 Correct 135 ms 504 KB Output is correct
57 Correct 128 ms 384 KB Output is correct
58 Correct 124 ms 504 KB Output is correct
59 Correct 104 ms 528 KB Output is correct
60 Correct 139 ms 504 KB Output is correct