結果

問題 No.1544 [Cherry 2nd Tune C] Synchroscope
ユーザー ningenMeningenMe
提出日時 2021-06-11 21:31:23
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 269 ms / 2,000 ms
コード長 4,493 bytes
コンパイル時間 2,529 ms
コンパイル使用メモリ 208,184 KB
実行使用メモリ 198,936 KB
最終ジャッジ日時 2024-12-14 22:29:36
合計ジャッジ時間 10,096 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 59 ms
50,816 KB
testcase_04 AC 133 ms
114,432 KB
testcase_05 AC 88 ms
73,716 KB
testcase_06 AC 113 ms
96,824 KB
testcase_07 AC 108 ms
93,212 KB
testcase_08 AC 73 ms
61,440 KB
testcase_09 AC 12 ms
9,600 KB
testcase_10 AC 107 ms
91,392 KB
testcase_11 AC 67 ms
56,064 KB
testcase_12 AC 56 ms
48,384 KB
testcase_13 AC 12 ms
10,564 KB
testcase_14 AC 145 ms
124,976 KB
testcase_15 AC 168 ms
146,632 KB
testcase_16 AC 53 ms
45,784 KB
testcase_17 AC 33 ms
28,544 KB
testcase_18 AC 9 ms
8,904 KB
testcase_19 AC 16 ms
13,828 KB
testcase_20 AC 142 ms
121,304 KB
testcase_21 AC 28 ms
24,648 KB
testcase_22 AC 13 ms
10,896 KB
testcase_23 AC 269 ms
198,824 KB
testcase_24 AC 247 ms
198,712 KB
testcase_25 AC 258 ms
198,764 KB
testcase_26 AC 251 ms
198,936 KB
testcase_27 AC 247 ms
198,732 KB
testcase_28 AC 231 ms
198,628 KB
testcase_29 AC 231 ms
198,732 KB
testcase_30 AC 229 ms
198,628 KB
testcase_31 AC 227 ms
198,708 KB
testcase_32 AC 227 ms
198,636 KB
testcase_33 AC 252 ms
198,408 KB
testcase_34 AC 2 ms
6,816 KB
testcase_35 AC 1 ms
6,816 KB
testcase_36 AC 1 ms
6,816 KB
testcase_37 AC 2 ms
6,816 KB
testcase_38 AC 256 ms
198,052 KB
testcase_39 AC 251 ms
198,348 KB
testcase_40 AC 253 ms
197,920 KB
testcase_41 AC 251 ms
198,248 KB
testcase_42 AC 248 ms
194,740 KB
testcase_43 AC 236 ms
186,696 KB
testcase_44 AC 241 ms
188,860 KB
testcase_45 AC 251 ms
195,420 KB
testcase_46 AC 242 ms
190,312 KB
testcase_47 AC 246 ms
192,620 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h> 
using namespace std; 
using int128  = __int128_t; 
using int64   = long long; 
using int32   = int; 
using uint128 = __uint128_t; 
using uint64  = unsigned long long; 
using uint32  = unsigned int; 

#define ALL(obj) (obj).begin(),(obj).end() 
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>; 

constexpr int64 MOD = 1'000'000'000LL + 7; //' 
constexpr int64 MOD2 = 998244353; 
constexpr int64 HIGHINF = 1'000'000'000'000'000'000LL; 
constexpr int64 LOWINF = 1'000'000'000'000'000LL; //' 
constexpr long double PI = 3.1415926535897932384626433L; 

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);} 
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));} 
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}} 
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;} 
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} 
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} 
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;} 
template <class T>ostream &operator<<(ostream &o, const deque<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;} 
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;} 
void print(void) {cout << endl;} 
template <class Head> void print(Head&& head) {cout << head;print();} 
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);} 
template <class T> void chmax(T& a, const T b){a=max(a,b);} 
template <class T> void chmin(T& a, const T b){a=min(a,b);} 
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;} 
inline constexpr int msb(int x) {return x?31-__builtin_clz(x):-1;} 
inline constexpr int64 ceil_div(const int64 a,const int64 b) {return (a+(b-1))/b;}// return ceil(a/b) 
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;} 
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;} 
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;} 

/*
 * @title Gcd - 高速GCD
 * @docs md/math/Gcd.md
 */
class Gcd{
public:
	inline static long long impl(long long n, long long m) {
		static constexpr long long K = 5;
		long long t,s;
		for(int i = 0; t = n - m, s = n - m * K, i < 80; ++i) {
			if(t<m){
				if(!t) return m;
				n = m, m = t;
			}
			else{
				if(!m) return t;
				n=t;
				if(t >= m * K) n = s;
			}
		}
		return impl(m, n % m);
	}
	inline static long long pre(long long n, long long m) {
		long long t;
		for(int i = 0; t = n - m, i < 4; ++i) {
			(t < m ? n=m,m=t : n=t);
			if(!m) return n;
		}
		return impl(n, m);
	}
	inline static long long gcd(long long n, long long m) {
		return (n>m ? pre(n,m) : pre(m,n));
	}
	inline static constexpr long long pureGcd(long long a, long long b) {
		return (b ? pureGcd(b, a % b):a);
	}
	inline static constexpr long long lcm(long long a, long long b) {
		return (a*b ? (a / gcd(a, b)*b): 0);
	}
	inline static constexpr long long extGcd(long long a, long long b, long long &x, long long &y) {
		if (b == 0) return x = 1, y = 0, a;
		long long d = extGcd(b, a%b, y, x);
		return y -= a / b * x, d;
	}
};

/** 
 * @url  
 * @est 
 */  
int main() { 
    cin.tie(0);ios::sync_with_stdio(false);
    int N,M; cin >> N >> M;
    vector<int> A(N),B(M),C(N*M),D(M*N);
    for(int i=0;i<N;++i) cin >> A[i];
    for(int i=0;i<M;++i) cin >> B[i];

    int ans = MOD;
    for(int i=0;i<N*M;++i) C[i] = A[i%N]; 
    for(int i=0;i<N*M;++i) D[i] = B[i%M]; 
    for(int i=0;i<N*M;++i) {
        corner(C[i]==D[i],i+1); 
    }
    cout << -1 << endl;
    return 0; 
}
0