結果
問題 | No.101 ぐるぐる!あみだくじ! |
ユーザー |
![]() |
提出日時 | 2018-04-01 15:11:08 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 1,986 bytes |
コンパイル時間 | 891 ms |
コンパイル使用メモリ | 102,776 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-26 05:27:27 |
合計ジャッジ時間 | 2,295 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 37 |
ソースコード
# include <iostream> # include <algorithm> # include <vector> # include <string> # include <set> # include <map> # include <cmath> # include <iomanip> # include <functional> # include <utility> # include <stack> # include <queue> # include <list> # include <tuple> # include <unordered_map> # include <numeric> # include <complex> # include <bitset> # include <random> # include <chrono> using namespace std; using LL = long long; using ULL = unsigned long long; constexpr int INF = 2147483647; constexpr int HINF = INF / 2; constexpr double DINF = 100000000000000000.0; constexpr double HDINF = 50000000000000000.0; constexpr long long LINF = 9223372036854775807; constexpr long long HLINF = 4500000000000000000; const double PI = acos(-1); int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 }; template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }; template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }; # define ALL(x) (x).begin(),(x).end() # define UNIQ(c) (c).erase(unique(ALL((c))),(c).end()) # define LOWER(s) transform(ALL((s)),(s).begin(),TL<char>) # define UPPER(s) transform(ALL((s)),(s).begin(),TU<char>) # define mp make_pair # define eb emplace_back # define FOR(i,a,b) for(LL i=(a);i<(b);i++) # define RFOR(i,a,b) for(LL i=(a);i>=(b);i--) # define REP(i,n) FOR(i,0,n) # define INIT std::ios::sync_with_stdio(false);std::cin.tie(0) int n; int k; int swapper[1010]; int x[1010], y[1010]; LL ans = 1; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a%b); } long long lcm(long long a, long long b) { long long g = gcd(a, b); return a / g * b; } int main() { cin >> n >> k; REP(i, k) { cin >> x[i] >> y[i]; x[i]--, y[i]--; } REP(i, n)swapper[i] = i; REP(i, k) { swap(swapper[x[i]], swapper[y[i]]); } REP(i, n) { int pos = i; int cnt = 0; do { cnt++; pos = swapper[pos]; } while (pos != i); ans = lcm(ans, cnt); } cout << ans << endl; }