Submission #1018328

#TimeUsernameProblemLanguageResultExecution timeMemory
1018328vjudge1Seats (IOI18_seats)C++17
11 / 100
4098 ms32644 KiB
#include <bits/stdc++.h> #include "seats.h" // #pragma GCC optimize("Ofast") // #pragma GCC target("avx2") // #pragma GCC optimization ("O3") // #pragma GCC optimization ("unroll-loops") // #pragma GCC target("popcnt") #define endl '\n' #define mp make_pair #define pb push_back #define f first #define s second #define fo(i,n) for(auto i =0 ; i < n;i++) #define fore(i,l,r) for(auto i = l; i < r;i++) #define forex(i,r,l) for(auto i = r; i >= l; i--) #define ffo(i,n) forex(i,n-1,0) #define all(x) x.begin(),x.end() #define lsb(x) x&(-x) #define sz(x) (int)x.size() #define gcd(a,b) __gcd(a,b) #define vii vector<ii> #define pq_min(a) priority_queue<a, vector<a>, greater<a>> #define fls cout.flush() using namespace std; using ll = long long; using ull = unsigned long long; using vi = vector<int>; using ii = pair<int,int>; using mii = map<int,int>; using lld = long double; void valid(ll in){cout<<((in)?"YES\n":"NO\n");} vi r, c; int n,m; void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) { r = R;c=C;n=H;m=W; } int swap_seats(int a, int b) { swap(r[a], r[b]);swap(c[a], c[b]); int mx=1e9,Mx=0,my=1e9,My=0; int ans = 0; fo(i,n*m){ mx=min(mx, r[i]); Mx=max(Mx, r[i]); my=min(my, c[i]); My=max(My, c[i]); if((Mx-mx+1)*(My-my+1) == i+1) ans++; } return ans; }
#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...