# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
425261 | vanic | Aliens (IOI16_aliens) | C++14 | 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 "aliens.h"
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
const int maxn=105;
int n, m, k;
bool bio[maxn][maxn];
void dfs(int x, int y){
assert(x<m && y<m);
if(bio[x][y]){
return;
}
bio[x][y]=1;
if(x==y){
return;
}
dfs(x+1, y);
dfs(x, y-1);
}
void dfs2(int x, int y){
assert(x<m && y<m);
if(bio[x][y]){
return;
}
bio[x][y]=1;
if(x==y){
return;
}
dfs(x-1, y);
dfs(x, y+1);
}
ll take_photos(int nn, int mm, int kk, vector < int > r, vector < int > c){
n=nn;
m=mm;
k=kk;
for(int i=0; i<n; i++){
dfs(min(r[i], c[i]), max(r[i], c[i]));
dfs2(max(r[i], c[i]), min(r[i], c[i]));
}
ll pov=0;
for(int i=0; i<m; i++){
for(int j=0; j<m; j++){
if(bio[i][j]){
pov++;
}
}
}
return pov;
}