Java-Competitive-Programming/Algorithms/twopointer.java at master · joney000/Java-Competitive-Programming · GitHub

History

executable file

427 lines (393 loc) · 10.1 KB

Raw

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

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

345

346

347

348

349

350

351

352

353

354

355

356

357

358

359

360

361

362

363

364

365

366

367

368

369

370

371

372

373

374

375

376

377

378

379

380

381

382

383

384

385

386

387

388

389

390

391

392

393

394

395

396

397

398

399

400

401

402

403

404

405

406

407

408

409

410

411

412

413

414

415

416

417

418

419

420

421

422

423

424

425

426

427

import java.util.*;

import java.lang.*;

import java.io.*;

import java.math.*;

* Coded by : Jaswant Singh

* Lang : Java

* Algorithm :

* Date : 20/march/2015

class Solution implements Comparable<Solution>{

public int vertex;

public long weight;

//public provide flexibility to access from outside the the class

//at the cost of security

public Solution(){

this.vertex = 0;

this.weight = 0L;

}

public Solution(int node , long weight){

this.vertex = node;

this.weight = weight;

}

@Override

public int compareTo(Solution e){

if(this.weight<e.weight)return -1;

else if(this.weight==e.weight) return 0;

else return 1;

}

//Fast Reader implementation , handles large I/O files

private boolean finished = false;

private InputStream stream;

private byte[] buf = new byte[1024]; //input Buffer

private int curChar;

private int numChars;

private SpaceCharFilter filter;

public Solution(InputStream stream){

this.stream = stream;

}

public static InputStream inputStream = System.in;

public static OutputStream outputStream = System.out;

public static Solution in = new Solution(inputStream);

public static PrintWriter out = new PrintWriter(outputStream);

* Overhead [Additional Temporary Storage]

* But it save a lot of time and Re Allocation of Space . it Reuse The same Buffers for all the Test Cases.

* take care of Limit : 10^5 + 5 (Runtime Error:OverFlow)

public static int tempints[] = new int[100005];

public static long templongs[] = new long[100005];

public static double tempdoubles[] = new double[100005];

public static char tempchars[] = new char[100005];

public static long mod = 1000000000+7;

public static ArrayList<Solution> adj[];

public static int source = 1;

//Creating Reader-Writer Buffer of initial size 2000B

//public static BufferedReader br = new BufferedReader(new InputStreamReader(System.in),2000);

// public static BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out),2000);

public static long INF = Integer.MAX_VALUE/1000;

public static int ss[] = new int[100005];

public static long d[] = new long[100005+1];

public static boolean f[] = new boolean[100005+1];

static {

Arrays.fill(d,INF);

}

public static void main(String []arg)throws Exception{

//String[] s= br.readLine().split(" ");

//int n = i();//no of edges

//int p = i(); //no of nodes

int n = i(); //long p = l(); long x = l();

//creating the undirected graph

int k = i();

//String s = s();

//long ans = 0,max =0;

int r1[] = new int[(int)n+1];

int r2[] = new int[(int)n+1];

for(int i=1;i<=n;i++)//adj[i] = new ArrayList<Solution>();

{

r1[i-1] = i();

}

for(int i=1;i<=n;i++)//adj[i] = new ArrayList<Solution>();

{

r2[i-1] = i();

}

Arrays.sort(r1,0,(int)n);

Arrays.sort(r2,0,(int)n);

// int idx = (int)n;

// int i=1;

int m = n;

int ans = 0;

int p1 = 0, p2 = 0;

while(p1 < n && p2 < m){

if(r1[p1] > r2[p2]){

if(Math.abs(r1[p1] - r2[p2]) == k){ p1++;p2++;ans++;}

else p2++;

}else if(r1[p1] < r2[p2]){

if(Math.abs(r2[p2] - r1[p1]) <= k){ p1++;p2++;ans++;}

else p1++;

}else{ p1++;p2++;ans++;}

}

out.write(""+(ans)+"\n");

out.flush();

return ;

}

// My General Utilities for Contest //

public static boolean check(int a , int b ,long n)throws Exception{

if(a<0||b<0)return false;

if(a>n||b>n)return false;

return true;

}

public static boolean isPrime(long n)throws Exception{

if(n==1)return false;

if(n<=3)return true;

if(n%2==0)return false;

for(int i=2 ;i <= Math.sqrt(n); i++){

if(n%i==0)return false;

}

return true;

}

public static long gcd (long a , long b)throws Exception{

if(b==0)return a;

return gcd(b , a%b);

}

public static long lcm (long a , long b)throws Exception{

if(a==0||b==0)return 0;

return (a*b)/gcd(a,b); //TAKE CARE OF Integer RANGE OVERFLOW

}

public static long mulmod(long a , long b ,long mod)throws Exception{

if(a==0||b==0)return 0;

if(b==1)return a;

long ans = mulmod(a,b/2,mod);

ans = (ans*2)% mod;

if(b%2==1)ans = (a + ans)% mod;

return ans;

}

public static long pow(long a , long b ,long mod)throws Exception{

if(b==0)return 1;

if(b==1)return a;

long ans = pow(a,b/2,mod);

ans = (ans * ans)% mod;

if(b%2==1)ans = (a * ans)% mod;

return ans;

}

// 20*20 nCr Pascal Table

public static long[][] ncrTable()throws Exception{

long ncr[][] = new long[21][21];

for(int i=0 ;i<=20 ;i++){ncr[i][0]=1;ncr[i][i]=1;}

for(int j=0;j<=20 ;j++){

for(int i=j+1;i<= 20 ;i++){

ncr[i][j] = ncr[i-1][j]+ncr[i-1][j-1];

}

return ncr;

}

// My I/O function //

public static int i()throws Exception{

return in.nextInt(); //read a single Integer

}

public static int[] is(int n)throws Exception{

for(int i=1 ; i <= n ;i++)tempints[i] = in.nextInt(); //read N integers

return tempints;

}

public static long l()throws Exception{ //read a single Long

return in.nextLong();

}

public static long[] ls(int n)throws Exception{ //read N Long type digits

for(int i=1 ; i <= n ;i++)templongs[i] = in.nextLong();

return templongs;

}

public static double d()throws Exception{

return in.nextDouble();

}

public static double[] ds(int n)throws Exception{

for(int i=1 ; i <= n ;i++)tempdoubles[i] = in.nextDouble();

return tempdoubles;

}

public static char c()throws Exception{

return in.nextCharacter();

}

public static char[] cs(int n)throws Exception{

for(int i=1 ; i <= n ;i++)tempchars[i] = in.nextCharacter();

return tempchars;

}

public static String s()throws Exception{

return in.nextLine();

}

public static BigInteger bi()throws Exception{

return in.nextBigInteger();

}

//*********************** for 0.2%f [precision data]***********************//

* roundoff upto 2 digits

* double roundOff = Math.round(a * 100.0) / 100.0;

* or

* System.out.printf("%.2f", val);

*print upto 2 digits after decimal

*val = ((long)(val * 100.0))/100.0;

public int read(){

if (numChars == -1){

throw new InputMismatchException ();

}

if (curChar >= numChars){

curChar = 0;

try{

numChars = stream.read (buf);

} catch (IOException e){

throw new InputMismatchException ();

}

if (numChars <= 0){

return -1;

}

return buf[curChar++];

}

public int peek(){

if (numChars == -1){

return -1;

}

if (curChar >= numChars){

curChar = 0;

try{

numChars = stream.read (buf);

} catch (IOException e){

return -1;

}

if (numChars <= 0){

return -1;

}

return buf[curChar];

}

public int nextInt(){

int c = read ();

while (isSpaceChar (c))

c = read ();

int sgn = 1;

if (c == '-'){

sgn = -1;

c = read ();

}

int res = 0;

do{

if(c==','){

c = read();

}

if (c < '0' || c > '9'){

throw new InputMismatchException ();

}

res *= 10;

res += c - '0';

c = read ();

} while (!isSpaceChar (c));

return res * sgn;

}

public long nextLong(){

int c = read ();

while (isSpaceChar (c))

c = read ();

int sgn = 1;

if (c == '-'){

sgn = -1;

c = read ();

}

long res = 0;

do{

if (c < '0' || c > '9'){

throw new InputMismatchException ();

}

res *= 10;

res += c - '0';

c = read ();

} while (!isSpaceChar (c));

return res * sgn;

}

public String nextString(){

int c = read ();

while (isSpaceChar (c))

c = read ();

StringBuilder res = new StringBuilder ();

do{

res.appendCodePoint (c);

c = read ();

} while (!isSpaceChar (c));

return res.toString ();

}

public boolean isSpaceChar(int c){

if (filter != null){

return filter.isSpaceChar (c);

}

return isWhitespace (c);

}

public static boolean isWhitespace(int c){

return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;

}

private String readLine0(){

StringBuilder buf = new StringBuilder ();

int c = read ();

while (c != '\n' && c != -1){

if (c != '\r'){

buf.appendCodePoint (c);

}

c = read ();

}

return buf.toString ();

}

public String nextLine(){

String s = readLine0 ();

while (s.trim ().length () == 0)

s = readLine0 ();

return s;

}

public String nextLine(boolean ignoreEmptyLines){

if (ignoreEmptyLines){

return nextLine ();

}else{

return readLine0 ();

}

public BigInteger nextBigInteger(){

try{

return new BigInteger (nextString ());

} catch (NumberFormatException e){

throw new InputMismatchException ();

}

public char nextCharacter(){

int c = read ();

while (isSpaceChar (c))

c = read ();

return (char) c;

}

public double nextDouble(){

int c = read ();

while (isSpaceChar (c))

c = read ();

int sgn = 1;

if (c == '-'){

sgn = -1;

c = read ();

}

double res = 0;

while (!isSpaceChar (c) && c != '.'){

if (c == 'e' || c == 'E'){

return res * Math.pow (10, nextInt ());

}

if (c < '0' || c > '9'){

throw new InputMismatchException ();

}

res *= 10;

res += c - '0';

c = read ();

}

if (c == '.'){

c = read ();

double m = 1;

while (!isSpaceChar (c)){

if (c == 'e' || c == 'E'){

return res * Math.pow (10, nextInt ());

}

if (c < '0' || c > '9'){

throw new InputMismatchException ();

}

m /= 10;

res += (c - '0') * m;

c = read ();

}

return res * sgn;

}

public boolean isExhausted(){

int value;

while (isSpaceChar (value = peek ()) && value != -1)

read ();

return value == -1;

}

public String next(){

return nextString ();

}

public SpaceCharFilter getFilter(){

return filter;

}

public void setFilter(SpaceCharFilter filter){

this.filter = filter;

}

public interface SpaceCharFilter{

public boolean isSpaceChar(int ch);

}

Java-Competitive-Programming/Algorithms/twopointer.java at master · joney000/Java-Competitive-Programming · GitHub

Expand file tree

Breadcrumbs

twopointer.java

Latest commit

History

Breadcrumbs

twopointer.java

File metadata and controls