oj.uz

Submission #449557

# Submission time Handle Problem Language Result Execution time Memory
449557 2021-08-02T07:06:22 Z Khizri Tracks in the Snow (BOI13_tracks) C++17
2.1875 / 100
 308 ms 27432 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=4000+5;
int t=1,n,m,a,b;
char arr[mxn][mxn];
void solve(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>arr[i][j];
			if(arr[i][j]=='R'){
				a=1;
			}
			else{
				b=1;
			}
		}
	}
	cout<<a+b<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 2124 KB Output isn't correct
2 Incorrect 0 ms 332 KB Output isn't correct
3 Incorrect 1 ms 460 KB Output isn't correct
4 Incorrect 4 ms 2124 KB Output isn't correct
5 Incorrect 3 ms 1356 KB Output isn't correct
6 Incorrect 0 ms 332 KB Output isn't correct
7 Incorrect 1 ms 460 KB Output isn't correct
8 Incorrect 1 ms 460 KB Output isn't correct
9 Incorrect 1 ms 588 KB Output isn't correct
10 Incorrect 2 ms 1228 KB Output isn't correct
11 Incorrect 2 ms 1100 KB Output isn't correct
12 Incorrect 3 ms 1356 KB Output isn't correct
13 Incorrect 2 ms 1372 KB Output isn't correct
14 Incorrect 2 ms 1356 KB Output isn't correct
15 Incorrect 6 ms 2252 KB Output isn't correct
16 Incorrect 7 ms 2124 KB Output isn't correct
17 Incorrect 6 ms 2124 KB Output isn't correct
18 Incorrect 4 ms 2124 KB Output isn't correct

Subtask #2
2.1875 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 15172 KB Output isn't correct
2 Incorrect 32 ms 5572 KB Output isn't correct
3 Incorrect 291 ms 27432 KB Output isn't correct
4 Incorrect 68 ms 10124 KB Output isn't correct
5 Incorrect 146 ms 19640 KB Output isn't correct
6 Incorrect 308 ms 27280 KB Output isn't correct
7 Incorrect 7 ms 15948 KB Output isn't correct
8 Incorrect 8 ms 15180 KB Output isn't correct
9 Incorrect 1 ms 332 KB Output isn't correct
10 Incorrect 1 ms 332 KB Output isn't correct
11 Incorrect 8 ms 15692 KB Output isn't correct
12 Incorrect 1 ms 844 KB Output isn't correct
13 Incorrect 32 ms 5508 KB Output isn't correct
14 Incorrect 24 ms 3744 KB Output isn't correct
15 Incorrect 20 ms 4172 KB Output isn't correct
16 Incorrect 16 ms 1868 KB Output isn't correct
17 Incorrect 81 ms 10988 KB Output isn't correct
18 Incorrect 78 ms 10788 KB Output isn't correct
19 Incorrect 68 ms 10112 KB Output isn't correct
20 Incorrect 66 ms 9276 KB Output isn't correct
21 Incorrect 187 ms 20428 KB Output isn't correct
22 Incorrect 150 ms 19608 KB Output isn't correct
23 Incorrect 152 ms 16408 KB Output isn't correct
24 Incorrect 171 ms 20164 KB Output isn't correct
25 Incorrect 305 ms 27428 KB Output isn't correct
26 Correct 198 ms 25328 KB Output is correct
27 Incorrect 302 ms 27264 KB Output isn't correct
28 Incorrect 301 ms 27332 KB Output isn't correct
29 Incorrect 301 ms 27328 KB Output isn't correct
30 Incorrect 278 ms 26948 KB Output isn't correct
31 Incorrect 252 ms 22836 KB Output isn't correct
32 Incorrect 273 ms 27316 KB Output isn't correct