結果
問題 | No.249 N言っちゃダメゲーム (2) |
ユーザー |
![]() |
提出日時 | 2018-10-18 20:22:22 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 1,000 ms |
コード長 | 2,534 bytes |
コンパイル時間 | 944 ms |
コンパイル使用メモリ | 101,520 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-07 00:35:09 |
合計ジャッジ時間 | 1,643 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 3 |
ソースコード
/* ---------- STL Libraries ---------- */// IO library#include <cstdio>#include <fstream>#include <iomanip>#include <ios>#include <iostream>// algorithm library#include <algorithm>#include <cmath>#include <numeric>#include <random>// container library#include <array>#include <bitset>#include <deque>#include <map>#include <queue>#include <set>#include <string>#include <tuple>#include <vector>/* ---------- Namespace ---------- */using namespace std;/* ---------- Type Abbreviation ---------- */template <typename T>using PQ = priority_queue<T>;template <typename T>using GPQ = priority_queue<T, vector<T>, greater<T>>;using ll = long long;#define fst first#define snd second#define mp make_pair#define mt make_tuple/* ---------- conversion ---------- */#define INT(c) static_cast<int>(c)#define CHAR(n) static_cast<char>(n)#define LL(n) static_cast<ll>(n)#define DOUBLE(n) static_cast<double>(n)/* ---------- container ---------- */#define ALL(v) (v).begin(), (v).end()#define SIZE(v) (LL((v).size()))#define FIND(v, k) (v).find(k) != (v).end()#define VFIND(v, k) find(ALL(v), k) != (v).end()#define gsort(b, e) sort(b, e, greater<decltype(*b)>())/* ----------- debug ---------- */template <class T>ostream& operator<<(ostream& os, vector<T> v) {os << "[";for (auto vv : v)os << vv << ",";return os << "]";}template <class T>ostream& operator<<(ostream& os, set<T> v) {os << "[";for (auto vv : v)os << vv << ",";return os << "]";}template <class L, class R>ostream& operator<<(ostream& os, pair<L, R> p) {return os << "(" << p.fst << "," << p.snd << ")";}/* ---------- Constants ---------- */// const ll MOD = 1e9 + 7;// const int INF = 1 << 25;// const ll INF = 1LL << 50;// const double PI = acos(-1);// const double EPS = 1e-10;// mt19937 mert(LL(time(0)));/* ---------- Short Functions ---------- */template <typename T>T sq(T a) {return a * a;}template <typename T>T gcd(T a, T b) {if (a > b) return gcd(b, a);return a == 0 ? b : gcd(b % a, a);}template <typename T, typename U>T mypow(T b, U n) {if (n == 0) return 1;if (n == 1) return b /* % MOD */;if (n % 2 == 0) {return mypow(b * b /* % MOD */, n / 2);} else {return mypow(b, n - 1) * b /* % MOD */;}}ll pcnt(ll b) {return __builtin_popcountll(b);}/* v-v-v-v-v-v-v-v-v Main Part v-v-v-v-v-v-v-v-v */int main() {cout << 500 << endl;return 0;}