Submission #46510

#TimeUsernameProblemLanguageResultExecution timeMemory
46510ikura355Cultivation (JOI17_cultivation)C++14
30 / 100
504 ms1128 KiB
//30 pts. #include<bits/stdc++.h> using namespace std; #define pii pair<int,int> #define X first #define Y second const int maxn = 300 + 5; const int inf = 1e9; int n,R,C; pii p[maxn]; vector<int> have[45]; int main() { scanf("%d%d%d",&R,&C,&n); for(int i=1;i<=n;i++) scanf("%d%d",&p[i].X,&p[i].Y); //fix up and down (R<=40) int ans = inf; for(int up=0;up<=R;up++) { for(int down=0;down<=R;down++) { for(int row=1;row<=R;row++) have[row].clear(); for(int x=1;x<=n;x++) { for(int i=max(1,p[x].X-up);i<=min(R,p[x].X+down);i++) { have[i].push_back(p[x].Y); } } for(int row=1;row<=R;row++) sort(have[row].begin(), have[row].end()); int left = 0, right = 0, gap = 0, bad = 0; for(int row=1;row<=R;row++) { if(have[row].size()==0) { bad = 1; break; } left = max(left, *have[row].begin()-1); right = max(right, C-*have[row].rbegin()); } for(int row=1;row<=R;row++) { for(int i=1;i<have[row].size();i++) gap = max(gap, have[row][i]-have[row][i-1]-1-left-right); } if(!bad) ans = min(ans, up + down + left + right + gap); // printf("up = %d down = %d : use %d %d %d\n",up,down,left,right,gap); } } printf("%d",ans); }

Compilation message (stderr)

cultivation.cpp: In function 'int main()':
cultivation.cpp:35:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
              for(int i=1;i<have[row].size();i++) gap = max(gap, have[row][i]-have[row][i-1]-1-left-right);
                          ~^~~~~~~~~~~~~~~~~
cultivation.cpp:13:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d",&R,&C,&n);
  ~~~~~^~~~~~~~~~~~~~~~~~~
cultivation.cpp:14:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++) scanf("%d%d",&p[i].X,&p[i].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...