Submission #922347

#TimeUsernameProblemLanguageResultExecution timeMemory
922347Shayan86Lampice (COCI21_lampice)C++14
50 / 50
1 ms504 KiB
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize("O3,unroll-loops") // #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") // Ofast, O0, O1, O2, O3, unroll-loops, fast-math, trapv typedef long long ll; typedef pair<ll, ll> pll; typedef pair<int, int> pii; #define Mp make_pair #define sep ' ' #define endl '\n' #define F first #define S second #define pb push_back #define all(x) (x).begin(),(x).end() #define kill(res) cout << res << '\n', exit(0); #define set_dec(x) cout << fixed << setprecision(x); #define fast_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define file_io freopen("input.txt", "r", stdin) ; freopen("output.txt", "w", stdout); mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const ll N = 3e5 + 50; const ll Mod = 1e9 + 7; ll n, m, arr[N]; int main(){ fast_io; cin >> n >> m; for(int i = 1; i <= n; i++){ cin >> arr[i]; } for(int l = 1; l <= n; l++){ for(int i = 1; l + i * m <= n+1; i++){ bool ch = true; for(int j = i; j < i*m; j++) if(arr[l+j] != arr[l+j%i]) ch = false; if(ch){ cout << i << endl; for(int x = l; x < l + i; x++) cout << arr[x] << sep; exit(0); } } } cout << -1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...