# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
975910 | vjudge1 | Star triangles (IZhO11_triangle) | C++17 | 1610 ms | 13796 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
using namespace std;
#define FUL(i, a, N) for(int i = a; i < N; i++)
#define FUE(i, a, N) for(int i = a; i <= N; i++)
int N, ans, temp;
pair<int, int> titik[300002];
map<int, vector<int>> titikX, titikY;
map<int, vector<int>> ::iterator it;
int main(){
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> N;
FUE(i, 1, N){
cin >> titik[i].fi >> titik[i].se;
}
// preprocessing
titikX[titik[1].fi].pb(titik[1].se);
titikY[titik[1].se].pb(titik[1].fi);
titikX[titik[2].fi].pb(titik[2].se);
titikY[titik[2].se].pb(titik[2].fi);
FUE(i, 3, N){
temp = 0;
it = titikX.find(titik[i].fi);
if(it != titikX.end()){
FUL(i, 0, it->se.size()){
temp += titikY[it->se[i]].size() - 1;
}
}
it = titikY.find(titik[i].se);
if(it != titikY.end()){
FUL(i, 0, it->se.size()){
temp += titikX[it->se[i]].size() - 1;
}
}
temp += titikX[titik[i].fi].size() * titikY[titik[i].se].size();
ans += temp;
titikX[titik[i].fi].pb(titik[i].se);
titikY[titik[i].se].pb(titik[i].fi);
}
cout << ans;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |