| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 251001 | rqi | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 1 ms | 512 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "treasure.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};
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
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 bits(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
int fstTrue(function<bool(int)> f, int lo, int hi) {
hi ++; assert(lo <= hi); // assuming f is increasing
while (lo < hi) { // find first index such that f is true
int mid = (lo+hi)/2;
f(mid) ? hi = mid : lo = mid+1;
}
return lo;
}
// 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
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) {
stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
str res = "{"; F0R(i,sz(v)) res += char('0'+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 A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
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 << ts(h); if (sizeof...(t)) cerr << ", ";
DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#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
}
int B[105][105];
// int countTreasure(int x1, int y1, int x2, int y2){
// int sum = 0;
// for(int i = x1; i <= x2; i++){
// for(int j = y1; j <= y2; j++){
// sum+=B[i][j];
// }
// }
// return sum;
// }
int N;
int A[105][105];
int csum[4][105][105];
int CT(int x1, int y1, int x2, int y2){
if(x1 > x2) swap(x1, x2);
if(y1 > y2) swap(y1, y2);
bool works = 0;
if(1 <= x1 && x1 <= x2 && x2 <= N && 1 <= y1 && y1 <= y2 && y2 <= N) works = 1;
if(works) return countTreasure(x1, y1, x2, y2);
return 0;
}
void findTreasure(int _N) {
N = _N;
if(N % 2 == 1){
for(int i = N/2+1; i <= N-1; i++){
for(int j = N/2+1; j <= N-1; j++){
csum[0][i][j] = CT(1, 1, i, j);
}
}
for(int i = N/2+1; i >= 2; i--){
for(int j = N/2+1; j <= N-1; j++){
csum[1][i][j] = CT(N, 1, i, j);
}
}
for(int i = N/2+1; i >= 2; i--){
for(int j = N/2+1; j >= 2; j--){
csum[2][i][j] = CT(N, N, i, j);
}
}
for(int i = N/2+1; i <= N-1; i++){
for(int j = N/2+1; j >= 2; j--){
csum[3][i][j] = CT(1, N, i, j);
}
}
csum[0][N][N] = csum[1][N][1] = csum[2][1][1] = csum[3][1][N] = CT(1, 1, N, N);
for(int i = N/2+1; i <= N-1; i++){
csum[0][i][N] = csum[3][i][1] = CT(1, 1, i, N);
csum[0][N][i] = csum[1][1][i] = CT(1, 1, N, i);
}
for(int i = N/2+1; i >= 1; i--){
csum[1][i][N] = csum[2][i][1] = CT(i, 1, N, N);
csum[3][N][i] = csum[2][1][i] = CT(1, i, N, N);
}
for(int i = N/2+2; i <= N; i++){
for(int j = N/2+2; j <= N; j++){
A[i][j] = csum[0][i][j]-csum[0][i-1][j]-csum[0][i][j-1]+csum[0][i-1][j-1];
}
}
for(int i = N/2; i >= 1; i--){
for(int j = N/2+2; j <= N; j++){
A[i][j] = csum[1][i][j]-csum[1][i+1][j]-csum[1][i][j-1]+csum[1][i+1][j-1];
}
}
for(int i = N/2; i >= 1; i--){
for(int j = N/2; j >= 1; j--){
A[i][j] = csum[2][i][j]-csum[2][i+1][j]-csum[2][i][j+1]+csum[2][i+1][j+1];
}
}
for(int i = N/2+2; i <= N; i++){
for(int j = N/2; j >= 1; j--){
A[i][j] = csum[3][i][j]-csum[3][i-1][j]-csum[3][i][j+1]+csum[3][i-1][j+1];
}
}
for(int i = N/2+2; i <= N; i++){
A[i][N/2+1] = csum[0][i][N/2+1]-csum[0][i-1][N/2+1];
for(int j = N/2; j >= 1; j--){
A[i][N/2+1]-=A[i][j];
}
A[N/2+1][i] = csum[0][N/2+1][i]-csum[0][N/2+1][i-1];
for(int j = N/2; j >= 1; j--){
A[N/2+1][i]-=A[j][i];
}
}
for(int i = N/2; i >= 1; i--){
A[i][N/2+1] = csum[2][i][N/2+1]-csum[2][i+1][N/2+1];
for(int j = N/2+2; j <= N; j++){
A[i][N/2+1]-=A[i][j];
}
A[N/2+1][i] = csum[2][N/2+1][i]-csum[2][N/2+1][i+1];
for(int j = N/2+2; j <= N; j++){
A[N/2+1][i]-=A[j][i];
}
}
A[N/2+1][N/2+1] = csum[0][N/2+1][N/2+1];
for(int i = 1; i <= N/2+1; i++){
for(int j = 1; j <= N/2+1; j++){
if(i == N/2+1 && j == N/2+1) break;
A[N/2+1][N/2+1]-=A[i][j];
}
}
}
else{
}
//dbg(csum[0][3][5]);
//dbg(csum[0][3][4]);
for(int i = 1; i <= N; i++){
for(int j = 1; j <= N; j++){
if(A[i][j] == 1) Report(i, j);
// dbg(i, j, A[i][j]);
// assert(A[i][j] == B[i][j]);
}
}
}
// int main(){
// int N = 49;
// for(int i = 1; i <= N; i++){
// for(int j = 1; j <= N; j++){
// B[i][j] = rand() % 2;
// //dbg(i, j, B[i][j]);
// }
// }
// findTreasure(N);
// }
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||