結果

問題 No.429 CupShuffle
ユーザー ant2357ant2357
提出日時 2016-10-06 00:30:30
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 27 ms / 2,000 ms
コード長 1,673 bytes
コンパイル時間 1,574 ms
コンパイル使用メモリ 174,624 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-11-21 17:33:41
合計ジャッジ時間 2,416 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 16
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'void solve()':
main.cpp:58:27: warning: 'p' may be used uninitialized [-Wmaybe-uninitialized]
   58 |         for (int i = 0; i < p; i++) {
      |                         ~~^~~
main.cpp:41:13: note: 'p' was declared here
   41 |         int p;
      |             ^

ソースコード

diff #
プレゼンテーションモードにする

#include "bits/stdc++.h"
#include <unordered_set>
#define _CRT_SECURE_NO_WARNINGS
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())
using namespace std;
const int dy[] = { 0, 1, 0, -1 };
const int dx[] = { 1, 0, -1, 0 };
using LL = long long int;
using LD = long double;
const int INF = (1 << 30) - 1;
const LL INF64 = ((LL)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;
using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<LL>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vs = vector<string>;
using vb = vector<bool>;
//==============================================
const int MAX = 100030;
vi A(MAX), B(MAX);
int n, k, x;
void solve() {
int p;
for (int i = 0; i < k; i++) {
string sa, sb;
cin >> sa >> sb;
if (sa == "?" && sb == "?") {
p = i;
} else {
A[i] = stoi(sa) - 1;
B[i] = stoi(sb) - 1;
}
}
vi rvCup(n), cup(n);
for (int i = 0; i < n; i++) cin >> rvCup[i];
for (int i = 0; i < n; i++) cup[i] = i + 1;
for (int i = 0; i < p; i++) {
swap(cup[A[i]], cup[B[i]]);
}
for (int i = k - 1; i > p; i--) {
swap(rvCup[A[i]], rvCup[B[i]]);
}
queue<int> ans;
for (int i = 0; i < n; i++) {
if (cup[i] != rvCup[i]) ans.push(i + 1);
}
for (int i = 0; !ans.empty(); i++) {
if (i) cout << " ";
cout << ans.front();
ans.pop();
}
cout << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k >> x;
solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0