Submission #00006

ソースコード

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

import java.io.*;
import java.util.*;
import java.lang.*;
import java.math.*;
import java.text.*;
class Main{
private static final InputStream in = System.in;
static final PrintWriter out = new PrintWriter(System.out);
public static void main(String args[]){
int[] y = new int[1000100];
int n = fgetInt();
for ( int i = 1; i <= n; i++ ) {
y[i] = y[i-1] + fgetInt();
}
int m = fgetInt();
for ( int i = 0; i < m; i++ ) {
int t = fgetInt();
t = lowerBound(y, n, t);
if ( t == n ) iprint("Broadcasting accident");
else iprint(t);
}
ifin();
}
static String fgetStr(){
return next();
}
static String fgetLine(){
return nextLine();
}
static char fgetChar(){
return fgetStr().charAt(0);
}
static int fgetInt(){
return nextInt();
}
static int fgetInt(int d){
return nextInt() + d;
}
static long fgetLong(){
return nextLong();
}
static double fgetDouble(){
return nextDouble();
}
static BigInteger getBig(){
return new BigInteger(fgetStr());
}
static String reverseStr(String str){
StringBuffer sb = new StringBuffer(str);
return sb.reverse().toString();
}
static int[] getIntArray(int length){
int[] array = new int[length];
int i;
for ( i = 0; i < length; i++ ) {
array[i] = fgetInt();
}
return array;
}
static int[][] getIntMap(int h, int w) {
int[][] map = new int[h][w];
int i;
for ( i = 0; i < h; i++ ) {
map[i] = getIntArray(w);
}
return map;
}
static void iprintIntArray(int[] object) {
int length = object.length;
int i;
iprintf(object[0]);
for ( i = 1; i < length; i++ ) iprintf(" " + object[i]);
iprint("");
}
static void iprintIntMap(int[][] object) {
int length = object.length;
int i;
for ( i = 0; i < length; i++ ) iprintIntArray(object[i]);
}
static void iprint(Object a){
out.println(a);
}
static void iprintf(Object a){
out.print(a);
}
static void ifin(){
out.flush();
}
static long kaijou (int n) {
int a = 1;
int i;
for ( i = 2; i <= n; i++ ) {
a *= i;
}
return a;
}
static int upperBound(int[] a, int n, int val){
int low = 0;
int hi = n;
while ( low < hi ) {
int mid = (low+hi) / 2;
if ( a[mid] <= val ) low = mid + 1;
else hi = mid;
}
return low;
}
static int lowerBound(int[] a, int n, int val){
int low = 0;
int hi = n;
while ( low < hi ) {
int mid = (low+hi) / 2;
if ( a[mid] < val ) low = mid + 1;
else hi = mid;
}
return low;
}
static boolean contains(int[] a, int n, int val){
int low = 0;
int hi = n;
while ( low < hi ) {
int mid = (low+hi)/2;
if ( a[mid] == val ) return true;
else if ( a[mid] < val ) low = mid+1;
else hi = mid;
}
return false;
}
private static final byte[] buffer = new byte[1024];
private static int ptr = 0;
private static int buflen = 0;
private static boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private static int readByte() {
if (hasNextByte()) return buffer[ptr++];
else return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public static boolean hasNext() {
while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
return hasNextByte();
}
public static String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public static String nextLine() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b) || b == 32) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public static long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public static int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public static double nextDouble() {
return Double.parseDouble(next());
}
}
class UnionFind {
private int[] parent;
private int[] rank;
public UnionFind(int n) {
parent = new int[n];
rank = new int[n];
for (int i = 0; i < n; i++) {
parent[i] = i;
rank[i] = 0;
}
}
public void union(int x, int y) {
int rootX = find(x);
int rootY = find(y);
if (rank[rootX] > rank[rootY]) {
parent[rootY] = rootX;
} else if(rank[rootX] < rank[rootY]) {
parent[rootX] = rootY;
} else if (rootX != rootY){
parent[rootY] = rootX;
rank[rootX]++;
}
}
public int find(int i) {
if (i != parent[i]) {
parent[i] = find(parent[i]);
}
return parent[i];
}
public boolean isSame(int x, int y) {
return find(x) == find(y);
}
}

ステータス

項目	データ
問題	0004 - 魔女っ娘ヒナくるん -Magic.02
ユーザー名	r1825
投稿日時	2018-08-22 10:04:40
言語	Java
状態	Accepted
得点	10
ソースコード長	5113 Byte
最大実行時間	219 ms
最大メモリ使用量	116524 KB

セット

	セット	得点	Cases
1	Burned Out	2 / 2	Magic0[1-9], Magic1[0-9], Magic2[0-9], Magic30
2	Missfortune	8 / 8	*

テストケース

ファイル名	状態	実行時間	メモリ使用量	#
Magic01	AC	219 ms	17504 KB	1	2
Magic02	AC	111 ms	17864 KB	1	2
Magic03	AC	92 ms	17792 KB	1	2
Magic04	AC	100 ms	17512 KB	1	2
Magic05	AC	91 ms	17852 KB	1	2
Magic06	AC	122 ms	20048 KB	1	2
Magic07	AC	95 ms	17876 KB	1	2
Magic08	AC	98 ms	18108 KB	1	2
Magic09	AC	99 ms	17520 KB	1	2
Magic10	AC	104 ms	19500 KB	1	2
Magic11	AC	105 ms	17892 KB	1	2
Magic12	AC	97 ms	18300 KB	1	2
Magic13	AC	94 ms	18012 KB	1	2
Magic14	AC	95 ms	19756 KB	1	2
Magic15	AC	96 ms	19440 KB	1	2
Magic16	AC	104 ms	18244 KB	1	2
Magic17	AC	99 ms	18080 KB	1	2
Magic18	AC	112 ms	17676 KB	1	2
Magic19	AC	106 ms	17692 KB	1	2
Magic20	AC	95 ms	18016 KB	1	2
Magic21	AC	89 ms	18264 KB	1	2
Magic22	AC	95 ms	18024 KB	1	2
Magic23	AC	96 ms	18144 KB	1	2
Magic24	AC	104 ms	18252 KB	1	2
Magic25	AC	99 ms	18036 KB	1	2
Magic26	AC	119 ms	18068 KB	1	2
Magic27	AC	100 ms	18436 KB	1	2
Magic28	AC	111 ms	18760 KB	1	2
Magic29	AC	102 ms	20012 KB	1	2
Magic30	AC	93 ms	17912 KB	1	2
Magic31	AC	165 ms	23332 KB		2
Magic32	AC	193 ms	27772 KB		2
Magic33	AC	159 ms	32608 KB		2
Magic34	AC	170 ms	37020 KB		2
Magic35	AC	150 ms	42100 KB		2
Magic36	AC	170 ms	46540 KB		2
Magic37	AC	186 ms	51068 KB		2
Magic38	AC	158 ms	56428 KB		2
Magic39	AC	164 ms	60872 KB		2
Magic40	AC	168 ms	66800 KB		2
Magic41	AC	155 ms	71392 KB		2
Magic42	AC	165 ms	74448 KB		2
Magic43	AC	186 ms	78896 KB		2
Magic44	AC	181 ms	84360 KB		2
Magic45	AC	168 ms	88388 KB		2
Magic46	AC	201 ms	93092 KB		2
Magic47	AC	153 ms	98152 KB		2
Magic48	AC	184 ms	104244 KB		2
Magic49	AC	162 ms	110036 KB		2
Magic50	AC	161 ms	116524 KB		2