結果
| 問題 | No.1626 三角形の構築 |
| ユーザー |
 null
|
| 提出日時 | 2021-05-23 01:41:24 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,649 bytes |
| コンパイル時間 | 9,702 ms |
| コンパイル使用メモリ | 487,960 KB |
| 実行使用メモリ | 84,716 KB |
| 最終ジャッジ日時 | 2024-10-12 11:26:56 |
| 合計ジャッジ時間 | 19,660 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | AC | 221 ms
13,028 KB |
| testcase_08 | AC | 393 ms
20,328 KB |
| testcase_09 | AC | 534 ms
39,032 KB |
| testcase_10 | AC | 371 ms
37,104 KB |
| testcase_11 | AC | 403 ms
23,012 KB |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | AC | 524 ms
36,724 KB |
| testcase_23 | AC | 373 ms
21,216 KB |
| testcase_24 | TLE | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
ソースコード
/*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#include <functional>
#include <complex>
#include <list>
#include <cassert>
#include <iomanip>
#include <set>
#include <stack>
#include <bitset>
#include <array>
#include <chrono>
//#pragma GCC target("arch=skylake-avx512")
#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse4")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define repeat(i, n, m) for(int i = n; i < (m); ++i)
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printim(a) printf(a ? "possible\n" : "imposible\n")
#define printdb(a) printf("%.50lf\n", a)
#define printLdb(a) printf("%.50Lf\n", a)
#define printdbd(a) printf("%.16lf\n", a)
#define prints(s) printf("%s\n", s.c_str())
#define all(x) (x).begin(), (x).end()
#define deg_to_rad(deg) (((deg)/360.0L)*2.0L*PI)
#define rad_to_deg(rad) (((rad)/2.0L/PI)*360.0L)
#define Please return
#define AC 0
#define manhattan_dist(a, b, c, d) (abs(a - c) + abs(b - d))
using ll = long long;
using ull = unsigned long long;
constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1e9 + 7;
constexpr ll mod = 998244353;
constexpr long double eps = 1e-6;
const long double PI = acosl(-1.0L);
using namespace std;
void scans(string& str) {
char c;
str = "";
scanf("%c", &c);
if (c == '\n')scanf("%c", &c);
while (c != '\n' && c != -1 && c != ' ') {
str += c;
scanf("%c", &c);
}
}
void scanc(char& str) {
char c;
scanf("%c", &c);
if (c == -1)return;
while (c == '\n') {
scanf("%c", &c);
}
str = c;
}
double acot(double x) {
return PI / 2 - atan(x);
}
ll LSB(ll n) { return (n & (-n)); }
template<typename T>
inline T chmin(T& a, const T& b) {
if (a > b)a = b;
return a;
}
template<typename T>
inline T chmax(T& a, const T& b) {
if (a < b)a = b;
return a;
}
//cpp_int
#if __has_include(<boost/multiprecision/cpp_int.hpp>)
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using namespace boost::multiprecision;
#else
using cpp_int = ll;
#endif
//atcoder library
#if __has_include(<atcoder/all>)
#include <atcoder/all>
//using namespace atcoder;
#endif
/*
random_device seed_gen;
mt19937 engine(seed_gen());
uniform_int_distribution dist(1, 100);
*/
/*----------------------------------------------------------------------------------*/
vector< int64_t > divisor(int64_t n) {
vector< int64_t > ret;
for (int64_t i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
ll sq(ll n) {
ll ng = -1, ok = 3 * 1e9;
while (abs(ng - ok) > 1) {
ll mid = (ok + ng) / 2;
if (mid * mid >= n)ok = mid;
else ng = mid;
}
if (ok * ok == n)return ok;
else return -1;
}
int main() {
int T;
scanf("%d", &T);
while (T--) {
ll s, t;
scanf("%lld%lld", &s, &t);
s *= 4;
vector<ll> ddd, d;
{
auto dd = divisor(s);
for (const auto& p : dd) {
for (const auto& q : dd) {
ddd.push_back(p * q);
}
}
}
s = s * s;
if (s % t) {
puts("-1 -1 -1");
continue;
}
s /= t;
for (const auto& aa : ddd) {
d.push_back((aa % t) ? aa : aa / t);
}
sort(all(d));
d.erase(unique(all(d)), d.end());
ll a = -1, b = -1, c = -1, x = 0, y = 0, z = 0;
set<multiset<ll>> ans;
for (const auto& aa : d) {
ll k = s / aa, r = t - aa;
x = aa;
if (r <= 0 or r * r - 4 * k < 0)continue;
ll p = sq(r * r - 4 * k);
if (p == -1)continue;
if ((r - p) > 0 and (r - p) % 2 == 0) {
y = (r - p) / 2;
z = t - x - y;
if ((x + y) % 2 or (y + z) % 2 or (z + x) % 2)continue;
a = y + z;
b = z + x;
c = x + y;
a /= 2;
b /= 2;
c /= 2;
ans.insert({ a, b, c });
}
if ((r + p) > 0 and (r + p) % 2 == 0) {
y = (r + p) / 2;
z = t - x - y;
if ((x + y) % 2 or (y + z) % 2 or (z + x) % 2)continue;
a = y + z;
b = z + x;
c = x + y;
a /= 2;
b /= 2;
c /= 2;
ans.insert({ a, b, c });
}
}
printf("%d\n", (int)ans.size());
for (const auto& aa : ans) {
for (const auto& aaa : aa)printf("%lld ", aaa);
puts("");
}
}
Please AC;
}