Submission #135166

#TimeUsernameProblemLanguageResultExecution timeMemory
135166dualityDango Maker (JOI18_dango_maker)C++11
100 / 100
719 ms18168 KiB
#include <bits/stdc++.h> using namespace std; #define mp make_pair #define pb push_back typedef long long int LLI; typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pii> vpii; char grid[3000][3000]; int main() { int i,j; int N,M; scanf("%d %d",&N,&M); for (i = 0; i < N; i++) { for (j = 0; j < M; j++) scanf(" %c",&grid[i][j]); } int ans = 0; for (i = 0; i < N+M-1; i++) { vi h,v; for (j = 0; j < N; j++) { int x = i-j,y = j; if ((x >= 0) && (x+2 < M) && (grid[y][x] == 'R') && (grid[y][x+1] == 'G') && (grid[y][x+2] == 'W')) h.pb(j); if ((x >= 0) && (x < M) && (y+2 < N) && (grid[y][x] == 'R') && (grid[y+1][x] == 'G') && (grid[y+2][x] == 'W')) v.pb(j); } ans += h.size()+v.size(); int k = 0; for (j = 0; j < h.size(); j++) { while ((k < v.size()) && (v[k] < h[j]-2)) k++; if ((k < v.size()) && (v[k] <= h[j])) k++,ans--; } } printf("%d\n",ans); return 0; }

Compilation message (stderr)

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:29:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < h.size(); j++) {
                     ~~^~~~~~~~~~
dango_maker.cpp:30:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while ((k < v.size()) && (v[k] < h[j]-2)) k++;
                     ~~^~~~~~~~~~
dango_maker.cpp:31:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if ((k < v.size()) && (v[k] <= h[j])) k++,ans--;
                  ~~^~~~~~~~~~
dango_maker.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&N,&M);
     ~~~~~^~~~~~~~~~~~~~~
dango_maker.cpp:16:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         for (j = 0; j < M; j++) scanf(" %c",&grid[i][j]);
                                 ~~~~~^~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...