| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 637008 |
2022-08-31T05:04:20 Z |
IWTIM |
Topovi (COCI15_topovi) |
C++14 |
|
20 ms |
29040 KB |
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = 998244353;
const int MX = 2e5+5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
struct DSU {
vi e; void init(int N) { e = vi(N,-1); }
int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); }
bool sameSet(int a, int b) { return get(a) == get(b); }
int size(int x) { return -e[get(x)]; }
bool unite(int x, int y) { // union by size
x = get(x), y = get(y); if (x == y) return 0;
if (e[x] > e[y]) swap(x,y);
e[x] += e[y]; e[y] = x; return 1;
}
};
/*
inline namespace Helpers {
//////////// is_iterable
// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
// this gets used only when we can call begin() and end() on that type
tcT, class = void> struct is_iterable : false_type {};
tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
decltype(end(declval<T>()))
>
> : true_type {};
tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
//////////// is_readable
tcT, class = void> struct is_readable : false_type {};
tcT> struct is_readable<T,
typename std::enable_if_t<
is_same_v<decltype(cin >> declval<T&>()), istream&>
>
> : true_type {};
tcT> constexpr bool is_readable_v = is_readable<T>::value;
//////////// is_printable
// // https://nafe.es/posts/2020-02-29-is-printable/
tcT, class = void> struct is_printable : false_type {};
tcT> struct is_printable<T,
typename std::enable_if_t<
is_same_v<decltype(cout << declval<T>()), ostream&>
>
> : true_type {};
tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
/*
inline namespace Helpers {
//////////// is_iterable
// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
// this gets used only when we can call begin() and end() on that type
tcT, class = void> struct is_iterable : false_type {};
tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
decltype(end(declval<T>()))
>
> : true_type {};
tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
//////////// is_readable
tcT, class = void> struct is_readable : false_type {};
tcT> struct is_readable<T,
typename std::enable_if_t<
is_same_v<decltype(cin >> declval<T&>()), istream&>
>
> : true_type {};
tcT> constexpr bool is_readable_v = is_readable<T>::value;
//////////// is_printable
// // https://nafe.es/posts/2020-02-29-is-printable/
tcT, class = void> struct is_printable : false_type {};
tcT> struct is_printable<T,
typename std::enable_if_t<
is_same_v<decltype(cout << declval<T>()), ostream&>
>
> : true_type {};
tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
const int N = 3e5 + 5;
int t,n,a[N],c[N],r[N],m,q;
map <int, int> mpc,mpr,val[N];
set <int> sx,sy;
main() {
//std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin>>n>>m>>q;
for (int i = 1; i <= n; i++) {
int x,y;
cin>>x>>y>>val[x][y];
sx.insert(x); sy.insert(y);
r[x] ^= val[x][y]; c[y] ^= val[x][y];
}
int ans = 0;
//for (int x : sx) mpr[r[x]]++;
//for (int y : sy) { mpc[c[y]]++; }
for (int i = 1; i <= n; i++) {
mpr[r[i]]++; mpc[c[i]]++;
}
for (int i = 1; i <= n; i++) ans += mpc[r[i]];
while (q--) {
int x,y,tx,ty;
cin>>x>>y>>tx>>ty;
int vl = val[x][y];
ans -= mpc[r[x]]; if (tx != x) ans -= mpc[r[tx]];
ans -= mpr[c[y]]; if (ty != y) ans -= mpr[c[ty]];
//cout<<ans<<" --- > ";
if (r[x] == c[y]) ans++; if (r[tx] == c[ty]) ans++;
mpr[r[x]]--; if (tx != x) mpr[r[tx]]--; mpc[c[y]]--; if (ty != y) mpc[c[ty]]--;
r[x] ^= vl; r[tx] ^= vl;
c[y] ^= vl; c[ty] ^= vl;
mpr[r[x]]++; if (tx != x) mpr[r[tx]]++; mpc[c[y]]++; if (ty != y) mpc[c[ty]]++;
//for (int i = 1; i <= n; i++) cout<<r[i]<<" "; cout<<"\n";
//for (int i = 1; i <= n; i++) cout<<c[i]<<" "; cout<<"\n";
ans += mpc[r[x]]; if (tx != x) ans += mpc[r[tx]];
ans += mpr[c[y]]; if (ty != y) ans += mpr[c[ty]];
if (r[x] == c[y]) ans--; if (r[tx] == c[ty]) ans--;
cout<<(long long)n * (long long)n - ans<<"\n";
val[tx][ty] = val[x][y]; val[x][y] = 0;
}
}
Compilation message
topovi.cpp:185:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
185 | main() {
| ^~~~
topovi.cpp: In function 'int main()':
topovi.cpp:210:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
210 | if (r[x] == c[y]) ans++; if (r[tx] == c[ty]) ans++;
| ^~
topovi.cpp:210:28: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
210 | if (r[x] == c[y]) ans++; if (r[tx] == c[ty]) ans++;
| ^~
topovi.cpp:219:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
219 | if (r[x] == c[y]) ans--; if (r[tx] == c[ty]) ans--;
| ^~
topovi.cpp:219:28: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
219 | if (r[x] == c[y]) ans--; if (r[tx] == c[ty]) ans--;
| ^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
8 ms |
14420 KB |
Output isn't correct |
| 2 |
Correct |
7 ms |
14420 KB |
Output is correct |
| 3 |
Incorrect |
7 ms |
14420 KB |
Output isn't correct |
| 4 |
Incorrect |
7 ms |
14404 KB |
Output isn't correct |
| 5 |
Incorrect |
8 ms |
14392 KB |
Output isn't correct |
| 6 |
Runtime error |
17 ms |
29012 KB |
Execution killed with signal 11 |
| 7 |
Runtime error |
17 ms |
29004 KB |
Execution killed with signal 11 |
| 8 |
Runtime error |
17 ms |
29012 KB |
Execution killed with signal 11 |
| 9 |
Runtime error |
16 ms |
29012 KB |
Execution killed with signal 11 |
| 10 |
Runtime error |
20 ms |
28968 KB |
Execution killed with signal 11 |
| 11 |
Runtime error |
18 ms |
29008 KB |
Execution killed with signal 11 |
| 12 |
Runtime error |
20 ms |
29012 KB |
Execution killed with signal 11 |
| 13 |
Runtime error |
17 ms |
29008 KB |
Execution killed with signal 11 |
| 14 |
Runtime error |
17 ms |
29004 KB |
Execution killed with signal 11 |
| 15 |
Runtime error |
19 ms |
28976 KB |
Execution killed with signal 11 |
| 16 |
Runtime error |
18 ms |
28952 KB |
Execution killed with signal 11 |
| 17 |
Runtime error |
17 ms |
29012 KB |
Execution killed with signal 11 |
| 18 |
Runtime error |
18 ms |
29012 KB |
Execution killed with signal 11 |
| 19 |
Runtime error |
18 ms |
29012 KB |
Execution killed with signal 11 |
| 20 |
Runtime error |
18 ms |
29040 KB |
Execution killed with signal 11 |
