OJ Board

i read the pdf and found it nice but i dont know how to implement it without looking like backtracking.... anyone can give me a hint?

ac, but took 2 seconds... i used cin and cout.... does anyone know how to make it faster?

I have beein trying this one.
I found out that:

read a new car
- if i cant add any previous cars, dont try this one
- i can either add the car to the left or to the right, so try it by doing:
for(i=tam;i>=0;i--) if this position is checked THEN
if i can add it at position i (which means to the ...

Hmmm... i tried going with floyd warshal...... the rest is the same. Any ideas?

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <algorithm>

using namespace std;
#define FOR(a,b) for(int a=0;a<b;a++)

#define MAXI (50)
int mat[MAXI][MAXI];
int t[MAXI];

void clear() {
FOR(i ...

My algorithm has runtime O(n * 3^s). As I want to reduce the memory usage, I use 2 pieces of 3^s memory, on start of very loop I copy one to another(I guess you know what I say... :)

O(n*3^s) here...... but it gets faster and with less memory as it goes bottom up using just one table size (3 ^ s ...

Great.... thanks Larry, got AC with +-0.9secs

I am not an expert so everything i did in here was a challenge for me...

What I did looks like a Nth dimension knapsack, but mapping the dimensions to a simple array.... (another challenge for me)

Is this a max flow problem? Any other similar ones in the problem set?

i got 9 wa before ac during the contest

Hey there.... what was the idea behind your algorithm?

ps: and wants to share it

i tried to use java (copied BigInteger and adapted it) but it did not work out... java sucks here

but back to C, I only have the basic arithmetic implemented, does anyone have an 'open source' one?

Either tests or suggestions are welcome....

seconds one is here:


#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>

using namespace std;

int dep, par;
char d[30][100];
int dp[30];
int vot[30];
char p[30][100];

char *getl(char *s) {
gets(s);
int len = strlen(s);
while(len && (s[len-1]==13 || s[len-1]==10 ...

I must be missing something here.... I tried this one twice.... first time, wrong answer, rewrote it from scratch, WA again... its easy, I just did what they said...

First one is here:



#include <stdio.h>
#include <string.h>

int main() {

int i,j,k,l,m,n,o,p;
char part[30][100];
char cand[30 ...

I have implemented all rules and cant get it right, tried a lot of input and i think its ok.
It should be an easy one...

Any suggestions?


#include <iostream>
#include <string>

using namespace std;

bool b;

string parse(string s,int len) {

if(s[0]=='2' && len==1) goto bz;
if(s[0]=='2 ...