제출 #121070

#제출 시각아이디문제언어결과실행 시간메모리
121070_7_7_Lottery (CEOI18_lot)C++14
45 / 100
1422 ms31864 KiB
#include <bits/stdc++.h> #define int long long //#pragma GCC optimize("Ofast") //#pragma comment(linker, "/stack:200000000") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4") #define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout); #define forev(i, b, a) for(int i = (b); i >= (a); --i) #define forn(i, a, b) for(int i = (a); i <= (b); ++i) #define sz(s) (int)s.size() #define all(x) x.bg, x.en #define pb push_back #define ppb pop_back #define mp make_pair #define rbg rbegin() #define bg begin() #define en end() #define s second #define f first using namespace std; typedef pair < long long, long long > pll; typedef pair < int, int > pii; typedef unsigned long long ull; typedef vector < pii > vpii; typedef vector < int > vi; typedef long double ldb; typedef long long ll; typedef double db; const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 265; const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9); const int inf = 1e9, N = 2e3 + 11, mod = 1e9 + 7; const db eps = 1e-12, pi = 3.14159265359; const ll INF = 1e18; int n, l, q, cnt[N][N], a[N], k; main () { ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> l; forn (i, 1, n) cin >> a[i]; cin >> q; forn (i, 1, n - l + 1) forn (j, i + 1, n - l + 1) forn (pos, 0, l - 1) if (a[i + pos] != a[j + pos]) { ++cnt[i][j]; ++cnt[j][i]; } while (q--) { cin >> k; forn (i, 1, n - l + 1) { int res = 0; forn (j, 1, n - l + 1) if (i != j && cnt[i][j] <= k) ++res; cout << res << ' '; } cout << endl; } return 0; }

컴파일 시 표준 에러 (stderr) 메시지

lot.cpp:47:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...