oj.uz

Submission #336534

# Submission time Handle Problem Language Result Execution time Memory
336534 2020-12-15T14:23:35 Z Kerim Star triangles (IZhO11_triangle) C++17
100 / 100
 457 ms 12140 KB 
#include "bits/stdc++.h"
#define MAXN 300009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
map<int,int>X,Y;
int x[MAXN],y[MAXN];
int main(){
    //freopen("file.in", "r", stdin);
    int n;
    scanf("%d",&n);	
    for(int i=1;i<=n;i++)
		scanf("%d%d",x+i,y+i),X[x[i]]++,Y[y[i]]++;
	ll ans=n;
	for(int i=1;i<=n;i++)
		ans+=X[x[i]]*1LL*Y[y[i]]-X[x[i]]-Y[y[i]];
	printf("%lld\n",ans);
	return 0;
}

Compilation message

triangle.cpp: In function 'int main()':
triangle.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   25 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
triangle.cpp:27:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   27 |   scanf("%d%d",x+i,y+i),X[x[i]]++,Y[y[i]]++;
      |   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 9 ms 1004 KB Output is correct
13 Correct 8 ms 1132 KB Output is correct
14 Correct 14 ms 1388 KB Output is correct
15 Correct 159 ms 4844 KB Output is correct
16 Correct 162 ms 4864 KB Output is correct
17 Correct 154 ms 4848 KB Output is correct
18 Correct 146 ms 4716 KB Output is correct
19 Correct 397 ms 7788 KB Output is correct
20 Correct 293 ms 9196 KB Output is correct
21 Correct 434 ms 12140 KB Output is correct
22 Correct 457 ms 12140 KB Output is correct