Pagini recente » Cod sursa (job #2719919) | Cod sursa (job #2314484) | Cod sursa (job #1063399) | Cod sursa (job #694009) | Cod sursa (job #2215174)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("gropi.in");
ofstream g("gropi.out");
int drum(int x1, int y1, int x2, int y2, int vec[4][100000])
{
int contor = 1;
while (y1 < y2)
{
if (vec[x1][y1 + 1] == 0)
{
contor++;
y1++;
}
else
{
contor++;
if (x1 == 1)
x1 = 2;
else
x1 = 1;
}
}
if (x1 != x2)
contor++;
return contor;
}
int main() {
int n, m, a, b,c, vec[4][100000], x1, y1 , x2, y2;
f >> n >> m;
for (int i = 1; i <= 2; i++)
for (int j = 1; j <= n; j++)
vec[i][j] = 0;
for (int i = 1; i <= m; i++)
{
f >> a >> b;
vec[a][b] = 1;
}
f >> c;
for (int i = 1; i <= c; i++)
{
f >> x1 >> y1 >> x2 >> y2;
if (y1 <= y2)
g << drum(x1, y1, x2, y2, vec) << endl;
else
g << drum(x2, y2, x1, y1, vec) << endl;
}
f.close();
g.close();
return 0;
}