oj.uz

Submission #449906

# Submission time Handle Problem Language Result Execution time Memory
449906 2021-08-02T09:24:51 Z Khizri Tracks in the Snow (BOI13_tracks) C++17
1.66667 / 100
 352 ms 16036 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 if(arr[i][j]!='.'){
				b=1;
			}
		}
	}
	cout<<4<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Subtask #1
1.66666666667 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 2124 KB Output isn't correct
2 Incorrect 1 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 1 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 716 KB Output isn't correct
10 Incorrect 2 ms 1228 KB Output isn't correct
11 Correct 2 ms 1100 KB Output is correct
12 Incorrect 3 ms 1356 KB Output isn't correct
13 Incorrect 3 ms 1356 KB Output isn't correct
14 Incorrect 3 ms 1356 KB Output isn't correct
15 Incorrect 7 ms 2228 KB Output isn't correct
16 Incorrect 7 ms 2124 KB Output isn't correct
17 Incorrect 7 ms 2124 KB Output isn't correct
18 Incorrect 4 ms 2220 KB Output isn't correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 15180 KB Output isn't correct
2 Incorrect 34 ms 5212 KB Output isn't correct
3 Incorrect 329 ms 16036 KB Output isn't correct
4 Incorrect 89 ms 7584 KB Output isn't correct
5 Incorrect 176 ms 11972 KB Output isn't correct
6 Incorrect 300 ms 15968 KB Output isn't correct
7 Incorrect 8 ms 15948 KB Output isn't correct
8 Incorrect 8 ms 15220 KB Output isn't correct
9 Incorrect 2 ms 332 KB Output isn't correct
10 Incorrect 1 ms 332 KB Output isn't correct
11 Incorrect 9 ms 15564 KB Output isn't correct
12 Incorrect 1 ms 844 KB Output isn't correct
13 Incorrect 33 ms 5196 KB Output isn't correct
14 Incorrect 19 ms 3752 KB Output isn't correct
15 Incorrect 22 ms 4152 KB Output isn't correct
16 Incorrect 14 ms 1868 KB Output isn't correct
17 Incorrect 91 ms 8192 KB Output isn't correct
18 Incorrect 95 ms 8092 KB Output isn't correct
19 Incorrect 69 ms 7692 KB Output isn't correct
20 Incorrect 63 ms 7060 KB Output isn't correct
21 Incorrect 171 ms 12380 KB Output isn't correct
22 Incorrect 161 ms 12004 KB Output isn't correct
23 Incorrect 154 ms 10044 KB Output isn't correct
24 Incorrect 167 ms 12444 KB Output isn't correct
25 Incorrect 352 ms 16024 KB Output isn't correct
26 Incorrect 218 ms 13996 KB Output isn't correct
27 Incorrect 255 ms 15968 KB Output isn't correct
28 Incorrect 317 ms 15936 KB Output isn't correct
29 Incorrect 291 ms 15944 KB Output isn't correct
30 Incorrect 296 ms 15580 KB Output isn't correct
31 Incorrect 253 ms 12812 KB Output isn't correct
32 Incorrect 303 ms 15904 KB Output isn't correct