# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
442199 | Yazan_Alattar | Aliens (IOI16_aliens) | C++17 | 0 ms | 0 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.
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <utility>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
const int M = 1005;
const int mod = 1e9+7;
bool a[M][M], vist[M][M];
int ans;
long long take_photos(int n, int m, int k, int[] r, int[] c)
{
for(int i = 0; i < n; ++i){
if(vist[r[i]][c[i]]) continue;
vist[r[i]][c[i]] = 1;
++ans;
}
return ans;
}
/*
int main()
{
//ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
vector <int> r, c;
int n, m, k;
cin >> n >> m >> k;
for(int i = 0; i < n; ++i){
int x;
cin >> x;
r.pb(x);
}
for(int i = 0; i < n; ++i){
int x;
cin >> x;
c.pb(x);
}
cout << take_photos(n, m, k, r, c);
return 0;
}
*/