oj.uz

Submission #41584

# Submission time Handle Problem Language Result Execution time Memory
41584 2018-02-19T14:01:33 Z OneSubmissionMan Dango Maker (JOI18_dango_maker) C++11
13 / 100
 2 ms 796 KB 
# include <bits/stdc++.h>

# define F first
# define S second
# define mp make_pair
// everything go according to my plan
# define pb push_back
# define sz(a) (int)(a.size())
# define vec vector
// shimkenttin kyzdary, dzyn, dzyn, dzyn...
# define y1    Y_U_NO_y1
# define left  Y_U_NO_left
# define right Y_U_NO_right

using namespace std;

typedef pair <int, int> pii;
typedef long long ll;
typedef long double ld;

const int Mod = (int)1e9 + 7;
const int MX = 1073741822;
const ll MXLL = 4e18;
const int Sz = 1110111;
// a pinch of soul
inline void Read_rap () {
  ios_base :: sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
}
inline void randomizer3000 () {
  unsigned int seed;
  asm ("rdtsc" : "=A"(seed));
  srand (seed);
}
void files (string problem) {
  if (fopen ((problem + ".in").c_str(),"r")) {
    freopen ((problem + ".in").c_str(),"r",stdin);
    freopen ((problem + ".out").c_str(),"w",stdout);
  }
}
void localInput (string in = "s") {
  if (fopen (in.c_str(), "r"))
    freopen (in.c_str(), "r", stdin);
  else {
    cerr << "Input file not found" << endl;
  }
}
int n, m;

int ans;
          
const int N = 3001;
     
bool used[N][N];

char a[N][N];

int main()
{
  Read_rap();
  //localInput();             
  cin >> n >> m;
  for (int i = 1; i <= n; i++)
  	for (int j = 1; j <= m; j++)
  		cin >> a[i][j];

 	for (int i = 1; i <= n; i++) {
 		for (int j = 1; j + 2 <= m; j++) {
 			if (a[i][j] == 'R' && a[i][j + 1] == 'G' && a[i][j + 2] == 'W')
 				ans++, used[i][j] = used[i][j + 1] = used[i][j + 2] = 1;
 		}
 	}                              	
 	for (int i = 1; i + 2 <= n; i++) {
 		for (int j = 1; j <= m; j++) {
 			if (!used[i][j] && !used[i + 1][j] && !used[i + 2][j] && a[i][j] == 'R' && a[i + 1][j] == 'G' && a[i + 2][j] == 'W')
 				ans++, used[i][j] = used[i + 1][j] = used[i + 2][j] = 1;
 		}
 	}
 	cout << ans;              	
  return 0;
}










// Coded by Z..

Compilation message

dango_maker.cpp: In function 'void files(std::__cxx11::string)':
dango_maker.cpp:37:50: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen ((problem + ".in").c_str(),"r",stdin);
                                                  ^
dango_maker.cpp:38:52: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen ((problem + ".out").c_str(),"w",stdout);
                                                    ^
dango_maker.cpp: In function 'void localInput(std::__cxx11::string)':
dango_maker.cpp:43:37: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen (in.c_str(), "r", stdin);
                                     ^

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 272 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 2 ms 480 KB Output is correct
4 Correct 1 ms 488 KB Output is correct
5 Correct 2 ms 508 KB Output is correct
6 Correct 2 ms 564 KB Output is correct
7 Correct 2 ms 568 KB Output is correct
8 Correct 2 ms 576 KB Output is correct
9 Correct 2 ms 580 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 2 ms 588 KB Output is correct
12 Correct 2 ms 592 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 2 ms 652 KB Output is correct
15 Correct 2 ms 656 KB Output is correct
16 Correct 2 ms 748 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 272 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 2 ms 480 KB Output is correct
4 Correct 1 ms 488 KB Output is correct
5 Correct 2 ms 508 KB Output is correct
6 Correct 2 ms 564 KB Output is correct
7 Correct 2 ms 568 KB Output is correct
8 Correct 2 ms 576 KB Output is correct
9 Correct 2 ms 580 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 2 ms 588 KB Output is correct
12 Correct 2 ms 592 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 2 ms 652 KB Output is correct
15 Correct 2 ms 656 KB Output is correct
16 Correct 2 ms 748 KB Output is correct
17 Correct 2 ms 748 KB Output is correct
18 Correct 2 ms 796 KB Output is correct
19 Incorrect 2 ms 796 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 272 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 2 ms 480 KB Output is correct
4 Correct 1 ms 488 KB Output is correct
5 Correct 2 ms 508 KB Output is correct
6 Correct 2 ms 564 KB Output is correct
7 Correct 2 ms 568 KB Output is correct
8 Correct 2 ms 576 KB Output is correct
9 Correct 2 ms 580 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 2 ms 588 KB Output is correct
12 Correct 2 ms 592 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 2 ms 652 KB Output is correct
15 Correct 2 ms 656 KB Output is correct
16 Correct 2 ms 748 KB Output is correct
17 Correct 2 ms 748 KB Output is correct
18 Correct 2 ms 796 KB Output is correct
19 Incorrect 2 ms 796 KB Output isn't correct
20 Halted 0 ms 0 KB -