結果
| 問題 | No.2319 Friends+ |
| ユーザー |
 Jerry Li
|
| 提出日時 | 2023-12-25 17:15:01 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 5,340 bytes |
| コンパイル時間 | 1,910 ms |
| コンパイル使用メモリ | 193,272 KB |
| 実行使用メモリ | 89,472 KB |
| 最終ジャッジ日時 | 2024-09-27 14:32:56 |
| 合計ジャッジ時間 | 7,922 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 32 ms
57,856 KB |
| testcase_01 | AC | 16 ms
52,480 KB |
| testcase_02 | TLE | - |
| testcase_03 | -- | - |
| testcase_04 | -- | - |
| testcase_05 | -- | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
| testcase_35 | -- | - |
| testcase_36 | -- | - |
| testcase_37 | -- | - |
| testcase_38 | -- | - |
| testcase_39 | -- | - |
| testcase_40 | -- | - |
| testcase_41 | -- | - |
| testcase_42 | -- | - |
| testcase_43 | -- | - |
| testcase_44 | -- | - |
| testcase_45 | -- | - |
| testcase_46 | -- | - |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
typedef int uci;
#define int long long
#define F first
#define S second
typedef complex<double> cd;
seed_seq seq{
(uint64_t) chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count(),
(uint64_t) __builtin_ia32_rdtsc(),
(uint64_t) (uintptr_t) make_unique<char>().get()
};
mt19937 rng(seq);
mt19937_64 lrng(seq);
struct debugger{
template <typename T>
debugger& operator<<(T &a){
#ifdef DEBUG
cerr << a;
#endif
return *this;
}
template <typename T>
debugger& operator<<(T &&a){
#ifdef DEBUG
cerr << a;
#endif
return *this;
}
} deb;
const double PI = acos(-1.0);
const int MAX_N = 1e5 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
//! function insert
//THINK FIRST, CODE SECOND
//DON'T GET STUCK ON ONE STRATEGY
//CALM DOWNNN FOR ONCE IN YOUR LIFE
//REDUCE
//COUGH E??!?!?!! O.O
//uwu i see you ryan
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = lrng();
return splitmix64(x + FIXED_RANDOM);
}
};
int adj[20000][313];
void solve() {
memset(adj, 0, sizeof(adj));
int n, m;
cin >> n >> m;
vector<ar<int, 2>> edges(m);
vector<int> curr(n);
for(int i{}; i < n; ++i)
cin >> curr[i];
vector<int> place(n);
for(int i{}; i < n; ++i)
place[i] = i/64;
vector<int> bits(n);
for(int i{}; i < n; ++i)
bits[i] = (1<<i%64);
vector<vector<int>> a(n);
for(int i{}; i < m; ++i){
cin >> edges[i][0] >> edges[i][1];
edges[i][0]--, edges[i][1]--;
adj[edges[i][0]][place[edges[i][1]]] |= bits[edges[i][1]];
adj[edges[i][1]][place[edges[i][0]]] |= bits[edges[i][0]];
a[edges[i][0]].push_back(edges[i][1]);
a[edges[i][1]].push_back(edges[i][0]);
}
int q;
cin >> q;
vector<ar<int, 2>> qs(q);
for(int i{}; i < q; ++i){
cin >> qs[i][0] >> qs[i][1];
qs[i][0]--, qs[i][1]--;
}
int sq = sqrt(q);
vector<int> from_room(sq);
vector<int> to_room(sq);
string out(q, '0');
vector<unordered_map<int, int>> counts(n);
for(int j{}; j < m; ++j){
counts[edges[j][0]][curr[edges[j][1]]]++;
counts[edges[j][1]][curr[edges[j][0]]]++;
}
vector<int> orig_room(curr);
for(int i{}; i < q; i += sq){
int last = min(q, i+sq);
for(int j = i; j < last; ++j){
int f_room = curr[qs[j][0]];
int t_room = curr[qs[j][1]];
if(f_room == t_room)
continue;
int st = counts[qs[j][0]][t_room];
for(int k = i; k < j; ++k){
if(out[k] == '1' && ((adj[qs[j][0]][place[qs[k][0]]])&(bits[qs[k][0]]))){
if(from_room[k-i] == t_room)
st--;
else if(to_room[k-i] == t_room)
st++;
}
}
if(st > 0){
out[j] = '1';
from_room[j-i] = f_room;
to_room[j-i] = t_room;
curr[qs[j][0]] = t_room;
}
}
for(int j{}; j < n; ++j){
if(orig_room[j] != curr[j]){
for(int k : a[j]){
counts[k][orig_room[j]]--;
if(counts[k][orig_room[j]] == 0)
counts[k].erase(orig_room[j]);
counts[k][curr[j]]++;
}
}
orig_room[j] = curr[j];
}
}
for(int i{}; i < q; ++i){
if(out[i] == '0')
cout << "No\n";
else
cout << "Yes\n";
}
}
uci main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// cout << "Case #" << t << ": ";
solve();
}
/*
random number generator stuff
num = rng(); gives integer number
num = uniform_int_distribution<int>(a, b)(rng); -> bounds [a, b]
num = uniform_real_distribution<double>(a, b)(rng); -> bounds [a, b)
can also instantiate distributions and call on generator:
uniform_int_distribution<int> thing(a, b);
num = thing(rng);
*/
// struct custom_hash {
// static uint64_t splitmix64(uint64_t x) {
// // http://xorshift.di.unimi.it/splitmix64.c
// x += 0x9e3779b97f4a7c15;
// x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
// x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
// return x ^ (x >> 31);
// }
// size_t operator()(uint64_t x) const {
// static const uint64_t FIXED_RANDOM = lrng();
// return splitmix64(x + FIXED_RANDOM);
// }
// };