結果
| 問題 | No.1330 Multiply or Divide |
| ユーザー |
 null
|
| 提出日時 | 2021-01-08 22:59:39 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 3,796 bytes |
| コンパイル時間 | 3,906 ms |
| コンパイル使用メモリ | 217,056 KB |
| 最終ジャッジ日時 | 2025-01-17 13:55:16 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 44 WA * 2 |
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:144:26: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type*’ {aka ‘long long int*’} [-Wformat=]
144 | rep(i, n)scanf("%d", &a[i]);
| ~^
| |
| int*
| %lld
main.cpp: In function ‘void scans(std::string&)’:
main.cpp:76:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
76 | scanf("%c", &c);
| ~~~~~^~~~~~~~~~
main.cpp:77:28: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
77 | if (c == '\n')scanf("%c", &c);
| ~~~~~^~~~~~~~~~
main.cpp:80:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
80 | scanf("%c", &c);
| ~~~~~^~~~~~~~~~
main.cpp: In function ‘void scanc(char&)’:
main.cpp:86:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
86 | scanf("%c", &c);
| ~~~~~^~~~~~~~~~
main.cpp:89:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
89 | scanf("%c", &c);
| ~~~~~^~~~~~~~~~
main.cpp: In function ‘int main()’:
main.cpp:142:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
142 | scanf("%d%lld%lld", &n, &m, &p);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
main.cp
ソースコード
/*このコード、と～おれ!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>)#include <boost/multiprecision/cpp_int.hpp>#include <boost/multiprecision/cpp_dec_float.hpp>using namespace boost::multiprecision;#elseusing 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);*//*----------------------------------------------------------------------------------*/int main() {int n;ll m, p;scanf("%d%lld%lld", &n, &m, &p);vector<ll> a(n);rep(i, n)scanf("%d", &a[i]);map<int, ll> mp, rev;map<int, bool> f;rep(i, n) {ll cnt = 0, q = a[i];while (a[i] % p == 0)a[i] /= p, ++cnt;if (not f[a[i]]) {f[a[i]] = true;mp[a[i]] = cnt;rev[a[i]] = q;}else {chmin(mp[a[i]], cnt);chmax(rev[a[i]], q);}}sort(all(a), greater<ll>());if (a[0] == 1)puts("-1");else {ll ans = LINF;a.erase(unique(all(a)), a.end());rep(i, a.size()) {if (a[i] == 1)break;ll x = rev[a[i]], cnt = 0;while (x <= m) {x *= a[i];++cnt;}chmin(ans, cnt + 1 + cnt * mp[a[i]]);}printf("%lld\n", ans);}Please AC;}