oj.uz

Submission #475083

# Submission time Handle Problem Language Result Execution time Memory
475083 2021-09-21T05:45:31 Z robell Treasure (different grader from official contest) (CEOI13_treasure2) C++17
100 / 100
 1 ms 332 KB 
#pragma GCC optimize("O2")
#include <treasure.h>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef long long ll;
#define pb push_back
#define eb emplace_back
#define countbits __builtin_popcount
#define beg0 __builtin_clz
#define terminal0 __builtin_ctz
#define mod 1e9+7
void setIO(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
}
void setIO(string f){
	freopen((f+".in").c_str(),"r",stdin);
	freopen((f+".out").c_str(),"w",stdout);
	setIO();
}
void findTreasure(int N){
	int grid[N+1][N+1];
	for (int i=N;i>=1;i--){
		for (int j=N;j>=1;j--){
			bool f = (i<=N/2);
			bool s = (j<=N/2);
			if (f&&s) grid[i][j]=grid[i][N]+grid[N][j]+countTreasure(i+1,j+1,N,N)-grid[N][N];
			if (f&&!s) grid[i][j]=grid[N][j]-countTreasure(i+1,1,N,j);
			if (!f&&s) grid[i][j]=grid[i][N]-countTreasure(1,j+1,i,N);
			if (!f&&!s) grid[i][j]=countTreasure(1,1,i,j);
		}
	}
	for (int i=1;i<=N;i++){
		for (int j=1;j<=N;j++){
			int res = grid[i][j];
			if (i>1) res-=grid[i-1][j];
			if (j>1) res-=grid[i][j-1];
			if (i>1&&j>1) res+=grid[i-1][j-1];
			if (res==1) Report(i,j);
		}
	}
}

Compilation message

treasure.cpp: In function 'void setIO(std::string)':
treasure.cpp:20:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |  freopen((f+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
treasure.cpp:21:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |  freopen((f+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 296 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 1 ms 204 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 1 ms 204 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 0 ms 204 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 1 ms 332 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 1 ms 332 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 1 ms 332 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 1 ms 332 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 1 ms 332 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 1 ms 332 KB Output is correct - N = 100, K = 43760000, score = 10