제출 #898521

#제출 시각아이디문제언어결과실행 시간메모리
898521jamjanekGarden (JOI23_garden)C++14
15 / 100
1212 ms12884 KiB
#include <bits/stdc++.h> using namespace std; int wiersz[10010]; int kolumna[10010]; bitset<10010>tab[10010]; int wys[10010]; int main() { int n, m, d, i, j, x, y; scanf("%d%d%d", &n, &m, &d); for(i=0;i<n;i++){ scanf("%d%d", &x, &y); swap(x,y); x = d-x-1; wiersz[x] = 1; kolumna[y] = 1; wiersz[x+d] = 1; kolumna[y+d] = 1; } for(i=0;i<m;i++){ scanf("%d%d", &x, &y); swap(x,y); x = d-x-1; tab[x][y] = 1; tab[x+d][y] = 1; tab[x][y+d] = 1; tab[x+d][y+d] = 1; } for(i=0;i<2*d;i++) if(wiersz[i]) for(j=0;j<2*d;j++) tab[i][j] = 1; for(i=0;i<2*d;i++) if(kolumna[i]) for(j=0;j<2*d;j++) tab[j][i] = 1; int wynik = d*d; //for(i=0;i<2*d;i++){for(j=0;j<2*d;j++)printf("%d", (int)tab[i][j]);printf("\n");} for(i=0;i<2*d;i++){ vector<pair<int,int>>KM; KM.push_back({-1,-1}); for(j=0;j<2*d;j++){ if(tab[i][j]==1) wys[j] = 0; else wys[j]++; while(KM.back().first>=wys[j])KM.pop_back(); //printf("%d %d: %d %d\n", i, j, wys[j], (j-KM.back().second)); if(wys[j]>0) wynik = min(wynik,(d-wys[j])*(d-(j-KM.back().second))); KM.push_back({wys[j], j}); } } printf("%d\n", wynik); return 0; }

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

garden.cpp: In function 'int main()':
garden.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%d%d%d", &n, &m, &d);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
garden.cpp:12:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |         scanf("%d%d", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~
garden.cpp:21:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |         scanf("%d%d", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...