oj.uz

답안 #752310

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
752310 2023-06-02T17:31:55 Z Sam_a17 Ancient Machine (JOI21_ancient_machine) C++17
70 / 100
 72 ms 8240 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
// #ifndef ONLINE_JUDGE
// #define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
// #else
// #define dbg(x)
// #endif
 
// #define sz(x) (int((x).size()))
// #define len(x) (int)x.length()
// #define all(x) (x).begin(), (x).end()
// #define rall(x) (x).rbegin(), (x).rend()
// #define clr(x) (x).clear()
// #define uniq(x) x.resize(unique(all(x)) - x.begin());
 
// #define pb push_back
// #define popf pop_front
// #define popb pop_back
// #define ld long double
// #define ll long long
 
// void print(long long t) {cerr << t;}
// void print(int t) {cerr << t;}
// void print(string t) {cerr << t;}
// void print(char t) {cerr << t;}
// void print(double t) {cerr << t;}
// void print(unsigned long long t) {cerr << t;}
// void print(long double t) {cerr << t;}
 
// template <class T, class V> void print(pair <T, V> p);
// template <class T> void print(vector <T> v);
// template <class T> void print(set <T> v);
// template <class T, class V> void print(map <T, V> v);
// template <class T> void print(multiset <T> v);
// template <class T> void print(T v[],T n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} cerr << "]";}
// template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
// template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
// template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
// template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
// template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
// template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// #define nl '\n'

// // for random generations
// mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// // mt19937 myrand(131);

// // for grid problems
// int dx[8] = {-1,0,1,0,1,-1,1,-1};
// int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// // lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
// void fastIO() {
//   ios_base::sync_with_stdio(false);
//   cin.tie(nullptr); cout.tie(nullptr);
// }
// // file in/out
// void setIO(string str = "") {
//   fastIO();
 
//   if (str != "") {
//     freopen((str + ".in").c_str(), "r", stdin);
//     freopen((str + ".out").c_str(), "w", stdout);
//   } else {
//     // freopen("input.txt", "r", stdin);
//     // freopen("output.txt", "w", stdout);
//   }
// }
 
// // Indexed Set
// template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

void Send(int a);

void Anna(int N, std::vector<char> S) {
  int ok = 0;
  for(int i = 0; i < N; i++) {
    if(ok) {
      Send((S[i] == 'Z'));
      continue;
    }

    if(S[i] == 'X') {
      Send(1);
      ok = 1;
    } else {
      Send(0);
    }
  }
}

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt(x) __builtin_popcount(x)
 
#define pb push_back
#define popf pop_front
#define popb pop_back
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

void Remove(int d);

void Bruno(int N, int L, vector<int> A) {
	int prv = -1 , flag = 0;
	for(int i = 0 ; i < N ; i++){
		if(A[i] == 0)	continue;

    for(int j = i - 1; j > prv ; j--){
			Remove(j);
		}

		if(flag) {
			Remove(i);
		}
		else {
			flag = i + 1;
		}

		prv = i;
	}

	for(int i = prv + 1 ; i < N ; i++)	Remove(i);
	
  if(flag)	Remove(flag - 1);
}

Compilation message

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 520 KB Output is correct
2 Correct 1 ms 520 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 520 KB Output is correct
8 Correct 1 ms 520 KB Output is correct
9 Correct 1 ms 520 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 520 KB Output is correct

Subtask #2
65.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 49 ms 8240 KB Partially correct
2 Partially correct 51 ms 8092 KB Partially correct
3 Partially correct 49 ms 8016 KB Partially correct
4 Partially correct 51 ms 8108 KB Partially correct
5 Partially correct 48 ms 8012 KB Partially correct
6 Partially correct 51 ms 8104 KB Partially correct
7 Partially correct 51 ms 8204 KB Partially correct
8 Partially correct 51 ms 8020 KB Partially correct
9 Partially correct 51 ms 8140 KB Partially correct
10 Partially correct 51 ms 8064 KB Partially correct
11 Partially correct 51 ms 8084 KB Partially correct
12 Partially correct 50 ms 8012 KB Partially correct
13 Partially correct 61 ms 8200 KB Partially correct
14 Partially correct 61 ms 8088 KB Partially correct
15 Partially correct 72 ms 8060 KB Partially correct
16 Partially correct 57 ms 8068 KB Partially correct
17 Partially correct 54 ms 8072 KB Partially correct
18 Partially correct 56 ms 8060 KB Partially correct
19 Partially correct 55 ms 8044 KB Partially correct
20 Partially correct 48 ms 8032 KB Partially correct
21 Partially correct 48 ms 8092 KB Partially correct
22 Partially correct 57 ms 8036 KB Partially correct
23 Partially correct 49 ms 8216 KB Partially correct
24 Partially correct 52 ms 8120 KB Partially correct
25 Partially correct 55 ms 8116 KB Partially correct
26 Partially correct 56 ms 8116 KB Partially correct
27 Partially correct 56 ms 8044 KB Partially correct
28 Partially correct 57 ms 8192 KB Partially correct
29 Partially correct 68 ms 8104 KB Partially correct
30 Partially correct 60 ms 8092 KB Partially correct
31 Partially correct 55 ms 8092 KB Partially correct
32 Partially correct 52 ms 8044 KB Partially correct
33 Partially correct 49 ms 8100 KB Partially correct