Submission #63845848
Source Code Expand
Copy
#include<iostream>#include<iomanip>#include<cmath>#include<climits>#include<vector>#include<string>#include<algorithm>#include<map>#include<set>#include<stack>#include<numeric>#include<queue>#include<bitset>#include<unordered_map>#include<unordered_set>#include<limits>#include<cassert>#include<ranges>#include<list>using namespace std;#define MOD 998244353
#include<iostream> #include<iomanip> #include<cmath> #include<climits> #include<vector> #include<string> #include<algorithm> #include<map> #include<set> #include<stack> #include<numeric> #include<queue> #include<bitset> #include<unordered_map> #include<unordered_set> #include<limits> #include<cassert> #include<ranges> #include<list> using namespace std; #define MOD 998244353 int main(){ long long n; cin>>n; //vector<long long> tri(2097153);//2*10^6 //for(long long i=1;i<2097153;++i){ //tri[i]=i*i*i; //} for(long long i=1;i<600000000;++i){ if(n%i!=0) continue; int ok=i+1,ng=600000000; while(abs(ok-ng) > 1 ){ int mid = (ok+ng)/2; if( (mid*mid) + mid*(mid-i) + (mid-i)*(mid-i) <= (n/i) ){ ok=mid; }else{ ng=mid; } } if( (ok*ok)+ok*(ok-i)+((ok-i)*(ok-i)) == n/i ){ cout<<ok<<" "<<ok-i<<endl; return 0; } } cout<<-1<<endl; //cout<<min(mini[n-1],mini[n+n-1])<<endl; //cout<<tmpp.size()<<endl; //cout<<*tmpp.begin()<<endl; //if(flag)cout<<"Yes"<<endl; //else cout<<"No"<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Cubes |
User | oblivimint |
Language | C++ 20 (gcc 12.2) |
Score | 0 |
Code Size | 1156 Byte |
Status | WA |
Exec Time | 1723 ms |
Memory | 3660 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 425 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt |
All | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 01_test_27.txt, 01_test_28.txt, 01_test_29.txt, 01_test_30.txt, 01_test_31.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_00.txt | AC | 1 ms | 3508 KB |
00_sample_01.txt | AC | 1721 ms | 3572 KB |
00_sample_02.txt | WA | 1722 ms | 3572 KB |
01_test_00.txt | AC | 1721 ms | 3496 KB |
01_test_01.txt | AC | 1721 ms | 3460 KB |
01_test_02.txt | WA | 1721 ms | 3512 KB |
01_test_03.txt | WA | 1721 ms | 3504 KB |
01_test_04.txt | WA | 1721 ms | 3500 KB |
01_test_05.txt | WA | 1721 ms | 3512 KB |
01_test_06.txt | WA | 1723 ms | 3512 KB |
01_test_07.txt | WA | 1721 ms | 3580 KB |
01_test_08.txt | WA | 1721 ms | 3508 KB |
01_test_09.txt | AC | 1721 ms | 3464 KB |
01_test_10.txt | AC | 1721 ms | 3588 KB |
01_test_11.txt | WA | 1721 ms | 3504 KB |
01_test_12.txt | WA | 1721 ms | 3656 KB |
01_test_13.txt | WA | 1721 ms | 3468 KB |
01_test_14.txt | WA | 1721 ms | 3460 KB |
01_test_15.txt | WA | 1721 ms | 3448 KB |
01_test_16.txt | WA | 1721 ms | 3460 KB |
01_test_17.txt | WA | 1721 ms | 3472 KB |
01_test_18.txt | WA | 1721 ms | 3444 KB |
01_test_19.txt | WA | 1721 ms | 3652 KB |
01_test_20.txt | WA | 1721 ms | 3572 KB |
01_test_21.txt | AC | 1721 ms | 3380 KB |
01_test_22.txt | AC | 1721 ms | 3660 KB |
01_test_23.txt | AC | 1721 ms | 3504 KB |
01_test_24.txt | AC | 1721 ms | 3660 KB |
01_test_25.txt | AC | 1721 ms | 3476 KB |
01_test_26.txt | AC | 1721 ms | 3444 KB |
01_test_27.txt | AC | 1 ms | 3508 KB |
01_test_28.txt | AC | 1 ms | 3508 KB |
01_test_29.txt | AC | 1 ms | 3448 KB |
01_test_30.txt | AC | 1 ms | 3512 KB |
01_test_31.txt | WA | 1721 ms | 3472 KB |