結果
問題 | No.629 グラフの中に眠る門松列 |
ユーザー | yuruhiya |
提出日時 | 2019-08-20 22:55:51 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 10,461 bytes |
コンパイル時間 | 1,574 ms |
コンパイル使用メモリ | 166,672 KB |
最終ジャッジ日時 | 2024-04-27 02:54:55 |
合計ジャッジ時間 | 2,040 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In function 'T InputF() [with T = char]': main.cpp:4:26: error: '_getchar_nolock' was not declared in this scope; did you mean 'getchar_unlocked'? 4 | #define getchar_unlocked _getchar_nolock | ^~~~~~~~~~~~~~~ main.cpp:55:30: note: in expansion of macro 'getchar_unlocked' 55 | char ret = '\0', c = getchar_unlocked(); | ^~~~~~~~~~~~~~~~ main.cpp: In function 'T InputF() [with T = std::__cxx11::basic_string<char>]': main.cpp:4:26: error: '_getchar_nolock' was not declared in this scope; did you mean 'getchar_unlocked'? 4 | #define getchar_unlocked _getchar_nolock | ^~~~~~~~~~~~~~~ main.cpp:60:30: note: in expansion of macro 'getchar_unlocked' 60 | string ret; char c = getchar_unlocked(); | ^~~~~~~~~~~~~~~~ main.cpp: In function 'T InputF() [with T = int]': main.cpp:4:26: error: '_getchar_nolock' was not declared in this scope; did you mean 'getchar_unlocked'? 4 | #define getchar_unlocked _getchar_nolock | ^~~~~~~~~~~~~~~ main.cpp:65:49: note: in expansion of macro 'getchar_unlocked' 65 | int ret = 0; bool neg = false; char c = getchar_unlocked(); | ^~~~~~~~~~~~~~~~ main.cpp: In function 'T InputF() [with T = long long int]': main.cpp:4:26: error: '_getchar_nolock' was not declared in this scope; did you mean 'getchar_unlocked'? 4 | #define getchar_unlocked _getchar_nolock | ^~~~~~~~~~~~~~~ main.cpp:71:48: note: in expansion of macro 'getchar_unlocked' 71 | LL ret = 0; bool neg = false; char c = getchar_unlocked(); | ^~~~~~~~~~~~~~~~ main.cpp: In function 'T InputF() [with T = double]': main.cpp:4:26: error: '_getchar_nolock' was not declared in this scope; did you mean 'getchar_unlocked'? 4 | #define
ソースコード
#define _CRT_SECURE_NO_WARNINGS #include "bits/stdc++.h" #if defined(_MSC_VER) || defined(ONLINE_JUDGE) #define getchar_unlocked _getchar_nolock #define putchar_unlocked _putchar_nolock #endif #define rep(i, n) for(int i=0; i<(n); ++i) #define FOR(i, m, n) for(int i=(m); i<(n); ++i) #define sz(x) ((int)(x).size()) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() #define mp make_pair #define pb push_back #define dump(x) cerr << #x << " = " << (x) << endl; using namespace std; using LL=long long; using VI=vector<int>; using VL=vector<LL>; using VS=vector<string>; using VD=vector<double>; using VVI=vector<VI>; using VVL=vector<VL>; using PII=pair<int, int>; using PLL=pair<LL, LL>; const int inf = (int)1e9; const double pi = acos(-1.0); const LL MOD = 1000000007; const string Snum = "0123456789"; const int dx[] = { -1,0,1,0,-1,-1,1,1 }, dy[] = { 0,1,0,-1,-1,1,-1,1 }; template<class T>void Sort(T& a) { sort(all(a)); } template<class T>void RSort(T& a) { sort(rall(a)); } template<class T>void Reverse(T& a) { reverse(all(a)); } template<class T>void Unique(T& a) { a.erase(unique(all(a)), a.end()); } template<class T>T Sorted(T a) { Sort(a); return a; } template<class T>T RSorted(T a) { RSort(a); return a; } template<class T>T Reversed(T a) { Reverse(a); return a; } template<class T>T Uniqued(T a) { Unique(a); return a; } template<class T>auto Max(const T& a) { return *max_element(all(a)); } template<class T>auto Min(const T& a) { return *min_element(all(a)); } template<class T>int MaxPos(const T& a) { return max_element(all(a)) - a.begin(); } template<class T>int MinPos(const T& a) { return min_element(all(a)) - a.begin(); } template<class T, class U>int Count(const T& a, const U& v) { return count(all(a), v); } template<class T, class U>int Find(const T& a, const U& v) { auto pos = find(all(a), v); return pos == a.end() ? -1 : pos - a.begin(); } template<class T, class U>U Sum(const T& a, const U& v) { return accumulate(all(a), v); } template<class T, class U>int Lower(const T& a, const U& v) { return lower_bound(all(a), v) - a.begin(); } template<class T, class U>int Upper(const T& a, const U& v) { return upper_bound(all(a), v) - a.begin(); } template<class T, class P>int CountIf(const T& a, P f) { return count_if(all(a), f); } template<class T, class P>void RemoveIf(T& a, P f) { a.erase(remove_if(all(a), f), a.end()); } template<class T>T Age(T n, T m) { return (n + m - 1) / m; } template<class T>T Gcd(T n, T m) { return m ? Gcd(m, n % m) : n; } template<class T>T Lcm(T n, T m) { return n / Gcd(n, m) * m; } template<class T>T Pow(T a, T n) { T r = 1; while (n > 0) { if (n & 1)r *= a; a *= a; n /= 2; }return r; } template<class T>T Powmod(T a, T n, T m = MOD) { T r = 1; while (n > 0) { if (n & 1)r = r * a % m, n--; else a = a * a % m, n /= 2; }return r; } string operator*(string s, int n) { string ret; rep(i, n)ret += s; return ret; } /* INPUT */ template<class T>T InputF() { T ret; cin >> ret; return ret; } template<> char InputF() { char ret = '\0', c = getchar_unlocked(); while (c != '\0' && c != '\n' && c != '\t' && c != ' ') { ret = c; c = getchar_unlocked(); } return ret; } template<> string InputF() { string ret; char c = getchar_unlocked(); while (c != '\0' && c != '\n' && c != '\t' && c != ' ') { ret.push_back(c); c = getchar_unlocked(); } return ret; } template<> int InputF() { int ret = 0; bool neg = false; char c = getchar_unlocked(); if (c == '-') { neg = true; c = getchar_unlocked(); } while ('0' <= c && c <= '9') { ret = ret * 10 + (c - '0'); c = getchar_unlocked(); } return neg ? -ret : ret; } template<> LL InputF() { LL ret = 0; bool neg = false; char c = getchar_unlocked(); if (c == '-') { neg = true; c = getchar_unlocked(); } while ('0' <= c && c <= '9') { ret = ret * 10LL + (LL(c) - LL('0')); c = getchar_unlocked(); } return neg ? -ret : ret; } template<> double InputF() { double ret = 0, dp = 1; bool neg = false, adp = false; char c = getchar_unlocked(); if (c == '-') { neg = true; c = getchar_unlocked(); } while (('0' <= c && c <= '9') || c == '.') { if (c == '.') { adp = true; } else if (adp) { dp *= 0.1; ret += (c - '0') * dp; } else { ret = ret * 10.0 + (c - '0'); } c = getchar_unlocked(); } return neg ? -ret : ret; } string GetLine() { string ret; char c = getchar_unlocked(); while (c != '\0' && c != '\n') { ret.push_back(c); c = getchar_unlocked(); } return ret; } template<class T>T Parse(string s) { return s; } template<> char Parse(string s) { return s.front(); } template<> string Parse(string s) { return s; } template<> int Parse(string s) { return stoi(s); } template<> LL Parse(string s) { return stoll(s); } template<> double Parse(string s) { return stod(s); } VS InputB; template<class T>struct InputC { operator T() { return InputF<T>(); } vector<T> operator[](int h) { vector<T> ret(h); rep(i, h)ret[i] = InputF<T>(); return ret; } vector<vector<T>> operator[](PII p) { int h, w; tie(h, w) = p; vector<vector<T>> ret(h, vector<T>(w)); rep(i, h)rep(j, w)ret[i][j] = InputF<T>(); return ret; } T operator()(int n) { while (sz(InputB) <= n)InputB.pb(InputF<string>()); return Parse<T>(InputB[n]); } vector<T> operator()(int n, int h) { vector<T> ret(h); rep(i, h)ret[i] = InputC::operator()(i + n); return ret; } vector<vector<T>> operator()(int n, int h, int w) { vector<vector<T>> ret(h, vector<T>(w)); rep(i, h)rep(j, w)ret[i][j] = InputC::operator()(n + i * w + j); return ret; } }; InputC<char> inc; InputC<string> ins; InputC<int> ini; InputC<LL> inl; InputC<double> ind; /* OUTPUT */ class ostreamfbuff : public basic_streambuf<char, char_traits<char>> { protected:int overflow(int nCh = EOF) { putchar_unlocked(nCh); return 0; } }; class ostreamf : public basic_iostream<char, char_traits<char>> { public:ostreamf(void) : basic_iostream<char, char_traits<char>>(new ostreamfbuff()) {} }; ostreamf coutf; ostream& operator<<(ostream& ostr, InputC<string> i) { ostr << string(i); return ostr; } struct BoolStr { string t, f; BoolStr(string _t, string _f) :t(_t), f(_f) {} }yes("yes", "no"), Yes("Yes", "No"), YES("YES", "NO"), Yay("Yay!", ":("); struct Divizer { string s; Divizer(string _s) :s(_s) {} }spc(" "), nosp(""), comma(","), lin("\n"); struct Output { bool flag = false; BoolStr bs; Divizer di; Output(bool f, BoolStr b, Divizer d) :flag(f), bs(b), di(d) {} template<class T>void print(T o) { coutf << o; } void print(double o) { printf("%.20f", o); } void print(bool o) { coutf << (o ? bs.t : bs.f); } template<class T, class U>void print(const pair<T, U>& o) { print(o.first); coutf << di.s; print(o.second); } template<class T>void print(const vector<T>& o) { for (int i = 0; i < (int)o.size(); ++i) { if (i != 0)coutf << di.s; print(o[i]); } } template<class T>void print(const vector<vector<T>>& o) { for (int i = 0; i < (int)o.size(); ++i) { if (i != 0)coutf << '\n'; print(o[i]); } } template<class T, class U>void print(const map<T, U>& o) { coutf << "Map"; for (auto a : o) { coutf << " {"; print(a); coutf << "},"; } coutf << '\n'; } template<class T>void print(const set<T>& o) { coutf << "Set {"; for (auto a : o) { print(a); coutf << ","; } coutf << "}\n"; } template<class T>Output operator ,(T o) { if (flag)coutf << di.s; print(o); Output t(true, bs, di); return t; } Output operator,(Output o) { coutf << '\n'; Output t(false, bs, di); return t; } Output operator,(BoolStr b) { Output t(flag, b, di); return t; } Output operator,(Divizer d) { Output t(flag, bs, d); return t; } }out(false, Yes, spc); /* ANSWER */ template<class T>struct Answer { T min, max, sum; int cnt; Answer() :min(numeric_limits<T>::max()), max(numeric_limits<T>::min()), sum(0), cnt(0) {} void operator=(T n) { min = std::min(min, n); max = std::max(max, n); sum += n; cnt++; } operator bool() { return cnt; } }; struct Point { int x, y; Point() :x(-1), y(-1) {} Point(int _x, int _y) :x(_x), y(_y) {} Point(int val, int h, int w) :x(val% w), y(val / w) {} Point operator+() { return *this; } Point operator-() { return { -x,-y }; } Point operator+(Point p) { return { x + p.x,y + p.y }; } Point operator-(Point p) { return { x - p.x,y - p.y }; } Point operator*(Point p) { return { x * p.x,y * p.y }; } Point operator/(Point p) { return { x / p.x,y / p.y }; } Point operator+(int d) { return { x + d,y + d }; } Point operator-(int d) { return { x - d,y - d }; } Point operator*(int d) { return { x * d,y * d }; } Point operator/(int d) { return { x / d,y / d }; } Point& operator+=(Point p) { x += p.x; y += p.y; return *this; } Point& operator-=(Point p) { x -= p.x; y -= p.y; return *this; } Point& operator*=(Point p) { x *= p.x; y *= p.y; return *this; } Point& operator/=(Point p) { x /= p.x; y /= p.y; return *this; } bool operator==(Point p) { return x == p.x && y == p.y; } bool operator!=(Point p) { return x != p.x || y != p.y; } int Dist(Point p) { return abs(x - p.x) + abs(y - p.y); } bool inBound(int H, int W) { return 0 <= x && x < W && 0 <= y && y < H; } array<Point, 4> Adjacent4() { return { Point(x,y + 1),Point(x,y + -1),Point(x + 1,y),Point(x + -1,y) }; } array<Point, 8> Adjacent8() { return { Point(x,y + 1),Point(x,y - 1),Point(x + 1,y),Point(x - 1,y), Point(x + 1,y + 1),Point(x + 1,y + -1),Point(x - 1,y + 1),Point(x - 1,y - 1) }; } template<class T>auto& operator[](T& v) { return v[y][x]; } }; const int INF = 1'000'000'000; const long long INFLL = 1'000'000'000'000'000'000; using Weight=int; using P=pair<Weight, int>; struct Edge { int to; Weight cost; }; struct Edge2 { int u, v; Weight cost; }; using Graph=vector<vector<Edge>>; bool Check(int a, int b, int c) { if (a == b || a == c || b == c) { return false; } else if ((a < b && c < b) || (a > b && c > b)) { return true; } else { return false; } } int main() { int n = ini, m = ini; VI a = ini[n]; vector<PII> e(m); rep(i, m)e[i] = mp(ini - 1, ini - 1); bool flag = false; rep(i, m)FOR(j, i + 1, m) { auto e1 = e[i], e2 = e[j]; int e11, e12, e21, e22; tie(e11, e12) = e1; tie(e21, e22) = e2; if (e11 == e21 && Check(a[e12], a[e11], a[e22])) { flag = true; } else if (e11 == e22 && Check(a[e12], a[e11], a[e21])) { flag = true; } else if (e12 == e21 && Check(a[e11], a[e12], a[e22])) { flag = true; } else if (e12 == e22 && Check(a[e11], a[e12], a[e21])) { flag = true; } } out, YES, flag, out; }