Submission #151286

# Submission time Handle Problem Language Result Execution time Memory
151286 2019-09-02T11:51:22 Z cheetose Tracks in the Snow (BOI13_tracks) C++11
2.1875 / 100
111 ms 18432 KB
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

char s[4000][4001];
int main() {
	int n,m;
	scanf("%d%d",&n,&m);
	fup(i,0,n-1,1)scanf("%s",s[i]);
	int a[2]={0};
	fup(i,0,n-1,1)fup(j,0,m-1,1)
	{
		if(s[i][j]=='R')a[0]=1;
		if(s[i][j]=='F')a[1]=1;
	}
	printf("%d",a[0]+a[1]);
}

Compilation message

tracks.cpp: In function 'int main()':
tracks.cpp:66:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~
tracks.cpp:67:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fup(i,0,n-1,1)scanf("%s",s[i]);
                ~~~~~^~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 2428 KB Output isn't correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Incorrect 2 ms 508 KB Output isn't correct
4 Incorrect 5 ms 2424 KB Output isn't correct
5 Incorrect 3 ms 1492 KB Output isn't correct
6 Incorrect 2 ms 376 KB Output isn't correct
7 Incorrect 2 ms 532 KB Output isn't correct
8 Incorrect 3 ms 504 KB Output isn't correct
9 Incorrect 3 ms 760 KB Output isn't correct
10 Incorrect 3 ms 1400 KB Output isn't correct
11 Incorrect 3 ms 1144 KB Output isn't correct
12 Incorrect 4 ms 1528 KB Output isn't correct
13 Incorrect 3 ms 1528 KB Output isn't correct
14 Incorrect 3 ms 1528 KB Output isn't correct
15 Incorrect 6 ms 2552 KB Output isn't correct
16 Incorrect 6 ms 2428 KB Output isn't correct
17 Incorrect 5 ms 2424 KB Output isn't correct
18 Incorrect 5 ms 2424 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 15352 KB Output isn't correct
2 Incorrect 15 ms 6776 KB Output isn't correct
3 Incorrect 111 ms 18432 KB Output isn't correct
4 Incorrect 31 ms 11384 KB Output isn't correct
5 Incorrect 46 ms 14968 KB Output isn't correct
6 Incorrect 110 ms 18316 KB Output isn't correct
7 Incorrect 17 ms 15992 KB Output isn't correct
8 Incorrect 16 ms 15352 KB Output isn't correct
9 Incorrect 2 ms 376 KB Output isn't correct
10 Incorrect 2 ms 376 KB Output isn't correct
11 Incorrect 14 ms 15736 KB Output isn't correct
12 Incorrect 3 ms 888 KB Output isn't correct
13 Incorrect 15 ms 6780 KB Output isn't correct
14 Incorrect 11 ms 4728 KB Output isn't correct
15 Incorrect 11 ms 5240 KB Output isn't correct
16 Incorrect 8 ms 2484 KB Output isn't correct
17 Incorrect 33 ms 12212 KB Output isn't correct
18 Incorrect 32 ms 12024 KB Output isn't correct
19 Incorrect 27 ms 11424 KB Output isn't correct
20 Incorrect 26 ms 10488 KB Output isn't correct
21 Incorrect 59 ms 15012 KB Output isn't correct
22 Incorrect 46 ms 14712 KB Output isn't correct
23 Incorrect 55 ms 12792 KB Output isn't correct
24 Incorrect 62 ms 15204 KB Output isn't correct
25 Incorrect 109 ms 18000 KB Output isn't correct
26 Correct 59 ms 15992 KB Output is correct
27 Incorrect 78 ms 18040 KB Output isn't correct
28 Incorrect 106 ms 18188 KB Output isn't correct
29 Incorrect 107 ms 17912 KB Output isn't correct
30 Incorrect 93 ms 17400 KB Output isn't correct
31 Incorrect 100 ms 14644 KB Output isn't correct
32 Incorrect 79 ms 17656 KB Output isn't correct