oj.uz

Submission #449904

# Submission time Handle Problem Language Result Execution time Memory
449904 2021-08-02T09:24:16 Z Khizri Tracks in the Snow (BOI13_tracks) C++17
1.66667 / 100
 332 ms 16060 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<<6<<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 2144 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 5 ms 2252 KB Output isn't correct
5 Incorrect 3 ms 1484 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 Correct 1 ms 460 KB Output is correct
9 Incorrect 1 ms 588 KB Output isn't correct
10 Incorrect 3 ms 1228 KB Output isn't correct
11 Incorrect 1 ms 1100 KB Output isn't correct
12 Incorrect 3 ms 1356 KB Output isn't correct
13 Incorrect 3 ms 1356 KB Output isn't correct
14 Incorrect 2 ms 1356 KB Output isn't correct
15 Incorrect 8 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
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 15180 KB Output isn't correct
2 Incorrect 32 ms 5136 KB Output isn't correct
3 Incorrect 288 ms 15928 KB Output isn't correct
4 Incorrect 70 ms 7624 KB Output isn't correct
5 Incorrect 147 ms 11940 KB Output isn't correct
6 Incorrect 298 ms 15900 KB Output isn't correct
7 Incorrect 7 ms 15948 KB Output isn't correct
8 Incorrect 7 ms 15180 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 7 ms 15636 KB Output isn't correct
12 Incorrect 1 ms 844 KB Output isn't correct
13 Incorrect 31 ms 5172 KB Output isn't correct
14 Incorrect 19 ms 3844 KB Output isn't correct
15 Incorrect 22 ms 4112 KB Output isn't correct
16 Incorrect 14 ms 1868 KB Output isn't correct
17 Incorrect 79 ms 8180 KB Output isn't correct
18 Incorrect 82 ms 8108 KB Output isn't correct
19 Incorrect 71 ms 7588 KB Output isn't correct
20 Incorrect 65 ms 7096 KB Output isn't correct
21 Incorrect 173 ms 12456 KB Output isn't correct
22 Incorrect 151 ms 12052 KB Output isn't correct
23 Incorrect 153 ms 10148 KB Output isn't correct
24 Incorrect 188 ms 12500 KB Output isn't correct
25 Incorrect 332 ms 15944 KB Output isn't correct
26 Incorrect 193 ms 13940 KB Output isn't correct
27 Incorrect 259 ms 15900 KB Output isn't correct
28 Incorrect 297 ms 15944 KB Output isn't correct
29 Incorrect 298 ms 16060 KB Output isn't correct
30 Incorrect 270 ms 15584 KB Output isn't correct
31 Incorrect 248 ms 12756 KB Output isn't correct
32 Incorrect 270 ms 15940 KB Output isn't correct