結果
問題 | No.930 数列圧縮 |
ユーザー |
|
提出日時 | 2019-11-23 12:50:54 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,260 bytes |
コンパイル時間 | 2,333 ms |
コンパイル使用メモリ | 195,092 KB |
最終ジャッジ日時 | 2025-01-08 05:30:20 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 WA * 2 |
other | AC * 3 WA * 21 |
コンパイルメッセージ
main.cpp: In function ‘int main(int, char**)’: main.cpp:68:42: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 68 | if (strchr(argv[1], 'i')) freopen("input.txt", "r", stdin); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:69:42: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 69 | if (strchr(argv[1], 'o')) freopen("output.txt", "w", stdout); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h> #define endl '\n' #define int long long #define lint long long #define pii pair<int, int> #define FOR(i, a, b) for(int i = (a); i < (b); ++i) #define REP(i, n) FOR(i, 0, n) #define ALL(v) (v).begin(), (v).end() #define SZ(v) ((int)v.size()) #define ZERO(a) memset(a, 0, sizeof(a)) #define MINUS(a) memset(a, 0xff, sizeof(a)) #define MINF(a) memset(a, 0x3f, sizeof(a)) #define POW(n) (1LL << (n)) #define POPCNT(n) (__builtin_popcount(n)) #define IN(i,a,b) (a <= i && i <= b) using namespace std; template <typename T> inline bool CHMIN(T& a,T b) { if(a>b) { a=b; return 1; } return 0; } template <typename T> inline bool CHMAX(T& a,T b) { if(a<b) { a=b; return 1; } return 0; } template <typename T> inline void SORT(T& a) { sort(ALL(a)); } template <typename T> inline void REV(T& a) { reverse(ALL(a)); } template <typename T> inline void UNI(T& a) { sort(ALL(a)); a.erase(unique(ALL(a)),a.end()); } template <typename T> inline T LB(vector<T>& v, T a) { return *lower_bound(ALL(v),a); } template <typename T> inline int LBP(vector<T>& v, T a) { return lower_bound(ALL(v),a) - v.begin(); } template <typename T> inline T UB(vector<T>& v, T a) { return *upper_bound(ALL(v),a); } template <typename T> inline int UBP(vector<T>& v, T a) { return upper_bound(ALL(v),a) - v.begin(); } template <typename T1, typename T2> ostream& operator<< (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os; } template <typename T1, typename T2> istream& operator>> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; } template <typename T> ostream& operator<< (ostream& os, const vector<T>& v) { REP(i,v.size()) { if (i) os << " "; os << v[i]; } return os; } template <typename T> istream& operator>> (istream& is, vector<T>& v) { for(T& in : v) is >> in; return is; } template <typename T = int> vector<T> make_v(size_t a) { return vector<T>(a); } template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...)); } template <typename T, typename V> typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) { t = v; } template <typename T, typename V> typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e, v); } const lint MOD = 1000000007; const lint INF = 0x3f3f3f3f3f3f3f3f; const double PI = 3.14159265358979323846; const double EPS = 1e-10; int N; int a[100010]; int p[100010]; void _main() { cin >> N; REP(i, N) { cin >> a[i]; a[i]--; p[a[i]] = i; } vector<int> ans; for (int i = N - 1; i >= 0; --i) { if (p[i] == N - 1) { if (SZ(ans) == N - 1) { cout << "No" << endl; return; } continue; } else { ans.push_back(i + 1); } } cout << "Yes" << endl; cout << ans << endl; } signed main(signed argc, char **argv) { if (argc > 1) { if (strchr(argv[1], 'i')) freopen("input.txt", "r", stdin); if (strchr(argv[1], 'o')) freopen("output.txt", "w", stdout); } ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(10); _main(); return 0; }