제출 #1195021

#제출 시각아이디문제언어결과실행 시간메모리
1195021nikulidIdeal city (IOI12_city)C++20
컴파일 에러
0 ms0 KiB
#include <climits> #include <vector> /* lemma: I will solve subtasks 1 and 2 proof: */ using namespace std; ll ans=0; vector<vector<int>> visitted, exists; // both are [y][x] vector<vector<bool>> DONE; void bfs(int I, int x, int y, int curdist){ // coords is [x,y] visitted[y][x] = I; if(exists[y+1][x+1] && visitted[y+1][x+1] != I){ ans += curdist+1; ans /= 2; bfs(I, x+1, y+1, curdist+1); } if(exists[y+1][x-1] && visitted[y+1][x-1] != I){ ans += curdist+1; ans /= 2; bfs(I, x-1, y+1, curdist+1); } if(exists[y-1][x+1] && visitted[y-1][x+1] != I){ ans += curdist+1; ans /= 2; bfs(I, x+1, y-1, curdist+1); } if(exists[y-1][x-1] && visitted[y-1][x-1] != I){ ans += curdist+1; ans /= 2; bfs(I, x-1, y-1, curdist+1); } return; } int DistanceSum(int N, int *X, int *Y) { DONE = vector<vector<bool>>(N+1, vector<bool>(N+1, 0)); visitted = vector<vector<int>>(N+1, vector<int>(N+1, 0)); exists = vector<vector<int>>(N+1, vector<int>(N+1, 0)); // find min X and Y values, to translate the graph to start at (1,1) int minX=INT_MAX-1, minY=INT_MAX-1; for(int i=0; i<N; i++){ minX = min(minX, X[i]); minY = min(minY, Y[i]); } for(int i=0; i<N; i++){ exists[Y[i]-minY][X[i]-minX] = 1; } for(int i=0; i<N; i++){ bfs(i, X[i]-minX, Y[i]-minY, 0); } ans /= 2; ans %= 1000000000; }

컴파일 시 표준 에러 (stderr) 메시지

city.cpp:11:1: error: 'll' does not name a type
   11 | ll ans=0;
      | ^~
city.cpp: In function 'void bfs(int, int, int, int)':
city.cpp:18:5: error: 'ans' was not declared in this scope; did you mean 'abs'?
   18 |     ans += curdist+1;
      |     ^~~
      |     abs
city.cpp:23:5: error: 'ans' was not declared in this scope; did you mean 'abs'?
   23 |     ans += curdist+1;
      |     ^~~
      |     abs
city.cpp:28:5: error: 'ans' was not declared in this scope; did you mean 'abs'?
   28 |     ans += curdist+1;
      |     ^~~
      |     abs
city.cpp:33:5: error: 'ans' was not declared in this scope; did you mean 'abs'?
   33 |     ans += curdist+1;
      |     ^~~
      |     abs
city.cpp: In function 'int DistanceSum(int, int*, int*)':
city.cpp:58:3: error: 'ans' was not declared in this scope; did you mean 'abs'?
   58 |   ans /= 2;
      |   ^~~
      |   abs
city.cpp:61:1: warning: no return statement in function returning non-void [-Wreturn-type]
   61 | }
      | ^