(UPD: 2024-12-04 14:48 UTC) Judge is not working due to Cloudflare incident. (URL) We can do nothing about it, sorry. After the incident is resolved, we will grade all submissions.

Submission #1111825

#TimeUsernameProblemLanguageResultExecution timeMemory
1111825steveonalexSeats (IOI18_seats)C++17
11 / 100
4058 ms40780 KiB
#include <bits/stdc++.h> #include "seats.h" using namespace std; typedef long long ll; typedef unsigned int ul; typedef unsigned long long ull; #define MASK(i) (1ULL << (i)) #define GETBIT(mask, i) (((mask) >> (i)) & 1) #define ALL(v) (v).begin(), (v).end() ll gcd(ll a, ll b){return __gcd(a, b);} ll max(ll a, ll b){return (a > b) ? a : b;} ll min(ll a, ll b){return (a < b) ? a : b;} ll LASTBIT(ll mask){return (mask) & (-mask);} int pop_cnt(ll mask){return __builtin_popcountll(mask);} int ctz(ull mask){return __builtin_ctzll(mask);} int logOf(ull mask){return 63 - __builtin_clzll(mask);} mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);} template <class T1, class T2> bool maximize(T1 &a, T2 b){ if (a < b) {a = b; return true;} return false; } template <class T1, class T2> bool minimize(T1 &a, T2 b){ if (a > b) {a = b; return true;} return false; } template <class T> void printArr(T the_array_itself, string separator = " ", string finish = "\n", ostream &out = cout){ for(auto item: the_array_itself) out << item << separator; out << finish; } template <class T> void remove_dup(vector<T> &a){ sort(ALL(a)); a.resize(unique(ALL(a)) - a.begin()); } const int INF = 1e9 + 69; int h, w; vector<int> r, c; void give_initial_chart(int H, int W, vector<int> R, vector<int> C) { h = H, w = W; r = R; c = C; } int swap_seats(int a, int b) { swap(r[a], r[b]); swap(c[a], c[b]); int l1 = INF, r1 = -INF, l2 = INF, r2 = -INF; int cnt = 0; for(int i = 0; i < h * w; ++i){ minimize(l1, r[i]); minimize(l2, c[i]); maximize(r1, r[i]); maximize(r2, c[i]); if (i + 1 == (r1 - l1 + 1) * (r2 - l2 + 1)) cnt++; } return cnt; } // int main(void){ // ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); // clock_t start = clock(); // int n, m;cin >> n >> m; // vector<int> r(n * m), c(n*m); // for(int i = 0; i < n*m; ++i) cin >> r[i] >> c[i]; // give_initial_chart(n, m, r, c); // int q; cin >> q; // while(q--){ // int u, v; cin >> u >> v; // cout << swap_seats(u, v) << "\n"; // } // cerr << "Time elapsed: " << clock() - start << " ms!\n"; // return 0; // }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...