Submission #305790
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)
#define tpl(...) make_tuple(__VA_ARGS__)
const int INF = 0x3f3f3f3f;
const double EPS = 1e-8;
const double PI = acos(-1);
typedef long long ll;
typedef pair<int,int> pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>basic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>&os,
const C& c){os<<'[';for(auto i=begin(c);i!=end(c);++i)os<<(i==begin(c)?"":" ")<<*i;return os<<']';}
template<class S,class T>ostream&operator<<(ostream &o,const pair<S,T>&t){return o<<'('<<t.first<<','<<t.second<<')';}
template<int N,class Tp>void output(ostream&,const Tp&){}
template<int N,class Tp,class,class ...Ts>void output(ostream &o,const Tp&t){if(N)o<<',';o<<get<N>(t);output<N+1,Tp,Ts...>(o,t);}
template<class ...Ts>ostream&operator<<(ostream&o,const tuple<Ts...>&t){o<<'(';output<0,tuple<Ts...>,Ts...>(o,t);return o<<')';}
template<class T>void output(T t,char z=10){if(t<0)t=-t,putchar(45);int c[20];
int k=0;while(t)c[k++]=t%10,t/=10;for(k||(c[k++]=0);k;)putchar(c[--k]^48);putchar(z);}
template<class T>void outputs(T t){output(t);}
template<class S,class ...T>void outputs(S a,T...t){output(a,32);outputs(t...);}
template<class T>void output(T *a,int n){REP(i,n)cout<<a[i]<<(i!=n-1?',':'\n');}
template<class T>void output(T *a,int n,int m){REP(i,n)output(a[i],m);}
template<class T>bool input(T &t){int n=1,c;for(t=0;!isdigit(c=getchar())&&~c&&c-45;);
if(!~c)return 0;for(c-45&&(n=0,t=c^48);isdigit(c=getchar());)t=10*t+c-48;t=n?-t:t;return 1;}
template<class S,class ...T>bool input(S&a,T&...t){input(a);return input(t...);}
template<class T>bool inputs(T *a, int n) { REP(i,n) if(!input(a[i])) return 0; return 1;}
ll func(ll n) {
if (n < 0) return 0;
return 1 + 2 * n * (n + 1);
}
typedef pair<ll,ll> pll;
pll solve(ll n) {
ll low = -1, high = 1e9;
while(low+1<high) {
ll mid = (low+high) / 2;
if (func(mid) <= n) {
low = mid;
} else {
high = mid;
}
}
ll b = high;
ll r = n - func(b-1);
// cout << b << " " << r << " " << func(b-1) << endl;
if (r == 0) {
return pll(-b,0);
} else if (n == func(b)-1) {
return pll(b,0);
} else {
ll x = -b + 1 + (r - 1) / 2;
ll yy = 1+(r-1)/2;
if (x >= 0) {
yy = b - x;
}
ll y = ((r-1)%2) ? yy : -yy;
return pll(x,y);
}
}
int main() {
int Q;
while(cin >> Q) {
REP(i,Q) {
ll n;
input(n);
n--;
auto ans = solve(n);
// cout << ans << endl;
outputs(ans.first, ans.second);
}
}
}
Submission Info
Submission Time |
|
Task |
B - n-th Points |
User |
sune2 |
Language |
C++11 (GCC 4.8.1) |
Score |
100 |
Code Size |
2975 Byte |
Status |
AC |
Exec Time |
163 ms |
Memory |
800 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
subtask0_sample_01.txt |
All |
subtask0_sample_01.txt, subtask1_large_01.txt, subtask1_mini01.txt, subtask1_random01.txt, subtask1_random02.txt, subtask1_random03.txt, subtask1_random04.txt, subtask1_random05.txt, subtask1_random06.txt, subtask1_random07.txt, subtask1_random08.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_sample_01.txt |
AC |
28 ms |
732 KB |
subtask1_large_01.txt |
AC |
131 ms |
800 KB |
subtask1_mini01.txt |
AC |
83 ms |
672 KB |
subtask1_random01.txt |
AC |
92 ms |
796 KB |
subtask1_random02.txt |
AC |
96 ms |
792 KB |
subtask1_random03.txt |
AC |
93 ms |
796 KB |
subtask1_random04.txt |
AC |
157 ms |
756 KB |
subtask1_random05.txt |
AC |
160 ms |
672 KB |
subtask1_random06.txt |
AC |
159 ms |
796 KB |
subtask1_random07.txt |
AC |
159 ms |
796 KB |
subtask1_random08.txt |
AC |
163 ms |
800 KB |