結果
問題 | No.1121 Social Distancing in Cinema |
ユーザー | heno239 |
提出日時 | 2020-07-22 21:57:02 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 44 ms / 2,000 ms |
コード長 | 3,323 bytes |
コンパイル時間 | 2,813 ms |
コンパイル使用メモリ | 115,640 KB |
実行使用メモリ | 22,528 KB |
最終ジャッジ日時 | 2023-09-04 18:30:48 |
合計ジャッジ時間 | 5,632 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 7 ms
19,132 KB |
testcase_01 | AC | 7 ms
19,180 KB |
testcase_02 | AC | 7 ms
19,200 KB |
testcase_03 | AC | 8 ms
19,340 KB |
testcase_04 | AC | 8 ms
19,312 KB |
testcase_05 | AC | 7 ms
19,268 KB |
testcase_06 | AC | 7 ms
19,244 KB |
testcase_07 | AC | 7 ms
19,268 KB |
testcase_08 | AC | 7 ms
19,212 KB |
testcase_09 | AC | 7 ms
19,152 KB |
testcase_10 | AC | 7 ms
19,144 KB |
testcase_11 | AC | 7 ms
19,400 KB |
testcase_12 | AC | 7 ms
19,256 KB |
testcase_13 | AC | 7 ms
19,160 KB |
testcase_14 | AC | 7 ms
19,184 KB |
testcase_15 | AC | 8 ms
19,376 KB |
testcase_16 | AC | 12 ms
19,624 KB |
testcase_17 | AC | 23 ms
20,732 KB |
testcase_18 | AC | 38 ms
22,000 KB |
testcase_19 | AC | 43 ms
22,376 KB |
testcase_20 | AC | 9 ms
19,316 KB |
testcase_21 | AC | 8 ms
19,428 KB |
testcase_22 | AC | 8 ms
19,240 KB |
testcase_23 | AC | 8 ms
19,312 KB |
testcase_24 | AC | 8 ms
19,164 KB |
testcase_25 | AC | 17 ms
19,896 KB |
testcase_26 | AC | 20 ms
20,104 KB |
testcase_27 | AC | 8 ms
19,352 KB |
testcase_28 | AC | 38 ms
21,972 KB |
testcase_29 | AC | 19 ms
19,832 KB |
testcase_30 | AC | 17 ms
19,824 KB |
testcase_31 | AC | 44 ms
22,436 KB |
testcase_32 | AC | 36 ms
21,680 KB |
testcase_33 | AC | 19 ms
20,296 KB |
testcase_34 | AC | 19 ms
20,016 KB |
testcase_35 | AC | 37 ms
21,872 KB |
testcase_36 | AC | 42 ms
22,372 KB |
testcase_37 | AC | 15 ms
19,868 KB |
testcase_38 | AC | 21 ms
20,364 KB |
testcase_39 | AC | 39 ms
22,140 KB |
testcase_40 | AC | 14 ms
19,528 KB |
testcase_41 | AC | 9 ms
19,356 KB |
testcase_42 | AC | 42 ms
22,412 KB |
testcase_43 | AC | 41 ms
22,528 KB |
testcase_44 | AC | 42 ms
22,520 KB |
testcase_45 | AC | 42 ms
22,352 KB |
testcase_46 | AC | 41 ms
22,220 KB |
testcase_47 | AC | 7 ms
19,276 KB |
testcase_48 | AC | 7 ms
19,132 KB |
ソースコード
#include<iostream> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<bitset> #include<stack> #include<unordered_map> #include<utility> #include<cassert> #include<complex> #include<numeric> using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 1000000007; const ll INF = mod * mod; typedef pair<int, int>P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair<ll, ll> LP; typedef long double ld; typedef pair<ld, ld> LDP; const ld eps = 1e-12; const ld pi = acos(-1.0); ll mod_pow(ll x, ll n,ll m) { ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, int n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } const int max_n = 1010000; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } int trans(int x, int y) { int d = x / 9; if (d % 2 == 0) { return 10 * (x % 9) + (y % 10); } else { return 10 * (x % 9) + ((y + 5) % 10); } } void solve(){ int n; cin >> n; vector<int> x(n), y(n); vector<vector<int>> ids(90); rep(i, n) { cin >> x[i] >> y[i]; int t = trans(x[i], y[i]); ids[t].push_back(i); } int ma = -1, chk = -1; rep(i, 90) { if (ma < (int)ids[i].size()) { ma = ids[i].size(); chk = i; } } cout << ids[chk].size() << "\n"; rep(i, ids[chk].size()) { if (i > 0)cout << " "; cout << ids[chk][i]+1; } cout << "\n"; } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(10); //init_f(); //cout << grandy(2, 3, false, false) << "\n"; //int t; cin >> t; rep(i, t) solve(); return 0; }