text stringlengths 49 983k |
|---|
#include<bits/stdc++.h>
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
using namespace std;
struct Op {
string op;
string v[3];
};
int getValue(vector<int> &state,int id) {
if( state[id] == -1 ) return state[id] = 0;
return state[id];
}
int main() {
int n;
cin >> n;
map<string,int> mp;
vector<Op> vec;
vector<int> state(26,-1);
rep(i,n) {
string line;
cin >> line;
mp[line] = i;
Op op;
cin >> op.op;
if( op.op == "ADD" || op.op == "SUB" ) rep(j,3) {
cin >> op.v[j];
if( 'a' <= op.v[j][0] && op.v[j][0] <= 'z' ) state[op.v[j][0]-'a'] = 0;
}
else if( op.op == "SET" || op.op == "IF" ) rep(j,2) {
cin >> op.v[j];
if( 'a' <= op.v[j][0] && op.v[j][0] <= 'z' ) state[op.v[j][0]-'a'] = 0;
}
vec.push_back(op);
}
//set<vector<int>> used[n];
auto t1 = chrono::system_clock::now();
int cur = 0;
while(1) {
if( cur >= n ) {
break;
}
/*
if( used[cur].count(state) ) {
puts("inf");
return 0;
}
used[cur].insert(state);
*/
auto t2 = chrono::system_clock::now();
auto diff = t2 - t1;
auto milli = chrono::duration_cast<chrono::milliseconds>(t2-t1);
if( milli.count() > 3000 ) {
puts("inf");
return 0;
}
if( vec[cur].op == "ADD" ) {
if( 'a' <= vec[cur].v[2][0] && vec[cur].v[2][0] <= 'z' ) {
int var1 = vec[cur].v[0][0] - 'a';
int var2 = vec[cur].v[1][0] - 'a';
int var3 = vec[cur].v[2][0] - 'a';
getValue(state,var1);
int tmp = state[var1];
state[var1] = getValue(state,var2) + getValue(state,var3);
if( state[var1] < 0 || state[var1] >= 16 ) {
state[var1] = tmp;
break;
}
} else {
int var1 = vec[cur].v[0][0] - 'a';
int var2 = vec[cur].v[1][0] - 'a';
int con = atoi(vec[cur].v[2].c_str());
getValue(state,var1);
int tmp = state[var1];
state[var1] = getValue(state,var2) + con;
if( state[var1] < 0 || state[var1] >= 16 ) {
state[var1] = tmp;
break;
}
}
} else if( vec[cur].op == "SUB" ) {
if( 'a' <= vec[cur].v[2][0] && vec[cur].v[2][0] <= 'z' ) {
int var1 = vec[cur].v[0][0] - 'a';
int var2 = vec[cur].v[1][0] - 'a';
int var3 = vec[cur].v[2][0] - 'a';
getValue(state,var1);
int tmp = state[var1];
state[var1] = getValue(state,var2) - getValue(state,var3);
if( state[var1] < 0 || state[var1] >= 16 ) {
state[var1] = tmp;
break;
}
} else {
int var1 = vec[cur].v[0][0] - 'a';
int var2 = vec[cur].v[1][0] - 'a';
int con = atoi(vec[cur].v[2].c_str());
getValue(state,var1);
int tmp = state[var1];
state[var1] = getValue(state,var2) - con;
if( state[var1] < 0 || state[var1] >= 16 ) {
state[var1] = tmp;
break;
}
}
} else if( vec[cur].op == "SET" ) {
if( 'a' <= vec[cur].v[1][0] && vec[cur].v[1][0] <= 'z' ) {
int var1 = vec[cur].v[0][0] - 'a';
int var2 = vec[cur].v[1][0] - 'a';
getValue(state,var1);
state[var1] = getValue(state,var2);
} else {
int var1 = vec[cur].v[0][0] - 'a';
int con = atoi(vec[cur].v[1].c_str());
getValue(state,var1);
int tmp = state[var1];
state[var1] = con;
if( state[var1] < 0 || state[var1] >= 16 ) {
state[var1] = tmp;
break;
}
}
} else if( vec[cur].op == "IF" ) {
int var = vec[cur].v[0][0] - 'a';
if( getValue(state,var) ) {
string dest = vec[cur].v[1];
if( !mp.count(dest) ) break;
cur = mp[dest];
continue;
}
} else {
break;
}
++cur;
}
rep(i,26) {
if( state[i] >= 0 ) {
cout << (char)('a'+i) << "=" << state[i] << endl;
}
}
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> V;
typedef pair<ll,ll> P;
typedef map<ll,ll> M;
#define REP(i,n) for(ll (i) = 0; (i) < (n); ++(i))
signed main(){
int n;
cin >> n;
V line(n);
M line_map;
vector<string> type(n);
vector<vector<string>> args(n);
set<int> variables;
M value_map;
vector<int> val_ind;
REP(i,n){
cin >> line[i] >> type[i];
line_map[line[i]] = i;
string s = type[i];
if(s == "ADD" || s == "SUB")
args[i].resize(3);
if(s == "SET" || s == "IF")
args[i].resize(2);
if(s == "HALT")
args[i].resize(0);
for(auto& x : args[i])
cin >> x;
if(s == "ADD" || s == "SUB"){
variables.insert(args[i][0][0]);
variables.insert(args[i][1][0]);
if(args[i][2].size() == 1 && args[i][2][0] >= 'a' && args[i][2][0] <= 'z')
variables.insert(args[i][2][0]);
}
if(s == "SET" || s == "IF"){
variables.insert(args[i][0][0]);
if(s == "SET" && args[i][1].size() == 1 && args[i][1][0] >= 'a' && args[i][1][0] <= 'z')
variables.insert(args[i][1][0]);
}
}
for(auto x : variables){
value_map[x] = val_ind.size();
val_ind.push_back(x);
}
V values(val_ind.size(), 0);
int now_line = 0;
auto print = [&](){
REP(i, val_ind.size()){
cout << char(val_ind[i]) << "=" << values[i] << endl;
}
std::exit(0);
};
time_t st = clock();
while(1.0 * (clock() - st) / CLOCKS_PER_SEC < 4.8){
if(now_line == n)
print();
string s = type[now_line];
/*
for(auto x : values)cout << x << " ";cout << endl;
cout << s << endl;
*/
if(s == "ADD" || s == "SUB"){
int val1 = values[value_map[args[now_line][1][0]]];
int val2 = (args[now_line][2].size() == 1 && args[now_line][2][0] >= 'a' && args[now_line][2][0] <= 'z')
? values[value_map[args[now_line][2][0]]]
: std::stoi(args[now_line][2]);
val1 += (s == "ADD" ? 1 : -1) * val2;
if(val1 < 0 || val1 >= 16)
print();
values[value_map[args[now_line][0][0]]] = val1;
}
if(s == "SET"){
int val = (args[now_line][1].size() == 1 && args[now_line][1][0] >= 'a' && args[now_line][1][0] <= 'z')
? values[value_map[args[now_line][1][0]]]
: std::stoi(args[now_line][1]);
if(val < 0 || val >= 16)
print();
values[value_map[args[now_line][0][0]]] = val;
}
if(s == "IF"){
int val = values[value_map[args[now_line][0][0]]];
if(val){
if(!line_map.count(stoi(args[now_line][1])))
print();
now_line = line_map[stoi(args[now_line][1])];
continue;
}
}
if(s == "HALT")print();
++now_line;
}
cout << "inf" << endl;
}
|
#include <iostream>
#include <map>
#include <sstream>
#include <cstring>
#include <cctype>
using namespace std;
constexpr int MAX = 1010;
constexpr int LIMIT = 50000000;
int N, line[MAX], order[MAX];
char c1[MAX], c2[MAX], c3[MAX];
int v[MAX];
int getNum(string& s)
{
if (s == "SET") return 0;
if (s == "ADD") return 1;
if (s == "SUB") return 2;
if (s == "IF") return 3;
return 4;
}
map<char, int> mp;
bool solve()
{
int idx = 0, v1, v2, next;
for (int i = 0; i < LIMIT; i++) {
if (idx == N) return 1;
switch (order[idx]) {
case 0:
if (v[idx] != -1) {
mp[c1[idx]] = v[idx];
} else {
mp[c1[idx]] = mp[c2[idx]];
}
break;
case 1:
v1 = mp[c2[idx]];
v2 = (v[idx] != -1 ? v[idx] : mp[c3[idx]]);
if (v1 + v2 >= 16) return 1;
mp[c1[idx]] = v1 + v2;
break;
case 2:
v1 = mp[c2[idx]];
v2 = (v[idx] != -1 ? v[idx] : mp[c3[idx]]);
if (v1 - v2 < 0) return 1;
mp[c1[idx]] = v1 - v2;
break;
case 3:
next = line[v[idx]];
if (next == -1) return 1;
if (mp[c1[idx]] != 0) {
idx = next;
continue;
}
break;
case 4:
return 1;
}
idx++;
}
return 0;
}
int main()
{
int x;
string s;
memset(line, -1, sizeof(line));
memset(v, -1, sizeof(v));
cin >> N;
for (int i = 0; i < N; i++) {
cin >> x >> s;
line[x] = i;
order[i] = getNum(s);
stringstream ss;
switch (order[i]) {
case 0:
case 3:
cin >> c1[i] >> s;
mp[c1[i]] = 0;
if (isdigit(s[0])) {
ss << s;
ss >> v[i];
} else {
c2[i] = s[0];
mp[c2[i]] = 0;
}
break;
case 1:
case 2:
cin >> c1[i] >> c2[i] >> s;
if (isdigit(s[0])) {
ss << s;
ss >> v[i];
} else {
c3[i] = s[0];
mp[c3[i]] = 0;
}
break;
}
}
if (solve()) {
for (auto& it : mp) {
cout << it.first << "=" << it.second << endl;
}
} else {
cout << "inf" << endl;
}
return 0;
} |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <iostream>
#include <set>
#include <map>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
enum ORDER{
ADD,
SUB,
SET,
IF,
HALT,
};
struct Info{
ORDER order;
char var1,var2,var3;
int con;
};
int current_var[26];
int history_var[50][26];
int line[50],rev_line[1001];
Info info[50];
bool check[50][16][16][16][16][16];
char table[50][51];
int main(){
for(int a = 0; a < 50; a++){
for(int b = 0; b < 16; b++){
for(int c = 0; c < 16; c++){
for(int d = 0; d < 16; d++){
for(int e = 0; e < 16; e++){
for(int f = 0; f < 16; f++){
check[a][b][c][d][e][f] = false;
}
}
}
}
}
}
for(int i = 0; i <= 1000; i++)rev_line[i] = -1;
for(int i = 0; i < 26; i++)current_var[i] = -1;
for(int i = 0; i < 50; i++){
for(int k = 0; k < 26; k++)history_var[i][k] = -1;
}
int N;
scanf("%d",&N);
getchar();
int tmp,index;
for(int i = 0; i < N; i++){
fgets(table[i],50,stdin);
tmp = 0;
for(index = 0; table[i][index] != ' '; index++){
tmp = 10*tmp+table[i][index]-'0';
}
line[i] = tmp;
rev_line[tmp] = i;
index++;
switch(table[i][index]){
case 'A': //ADD
info[i].order = ADD;
index += 4;
info[i].var1 = table[i][index];
current_var[info[i].var1-'a'] = 0;
index += 2;
info[i].var2 = table[i][index];
current_var[info[i].var2-'a'] = 0;
index += 2;
if(table[i][index] >= 'a' && table[i][index] <= 'z'){
info[i].var3 = table[i][index];
current_var[info[i].var3-'a'] = 0;
}else{
tmp = 0;
for(;table[i][index] >= '0' && table[i][index] <= '9';index++){
tmp = 10*tmp + table[i][index]-'0';
}
info[i].var3 = '@';
info[i].con = tmp;
}
break;
case 'S':
if(table[i][index+1] == 'U'){
info[i].order = SUB;
index += 4;
info[i].var1 = table[i][index];
current_var[info[i].var1-'a'] = 0;
index += 2;
info[i].var2 = table[i][index];
current_var[info[i].var2-'a'] = 0;
index += 2;
if(table[i][index] >= 'a' && table[i][index] <= 'z'){
info[i].var3 = table[i][index];
current_var[info[i].var3-'a'] = 0;
}else{
tmp = 0;
for(;table[i][index] >= '0' && table[i][index] <= '9';index++){
tmp = 10*tmp + table[i][index]-'0';
}
info[i].var3 = '@';
info[i].con = tmp;
}
}else{
info[i].order = SET;
index += 4;
info[i].var1 = table[i][index];
current_var[info[i].var1-'a'] = 0;
index += 2;
if(table[i][index] >= 'a' && table[i][index] <= 'z'){
info[i].var2 = table[i][index];
current_var[info[i].var2-'a'] = 0;
}else{
tmp = 0;
for(;table[i][index] >= '0' && table[i][index] <= '9';index++){
tmp = 10*tmp + table[i][index]-'0';
}
info[i].var2 = '@';
info[i].con = tmp;
}
}
break;
case 'I':
info[i].order = IF;
index += 3;
info[i].var1 = table[i][index];
current_var[info[i].var1-'a'] = 0;
index += 2;
tmp = 0;
for( ;table[i][index] >= '0' && table[i][index] <= '9'; index++){
tmp = 10*tmp+table[i][index]-'0';
}
info[i].con = tmp;
break;
case 'H':
info[i].order = HALT;
break;
}
}
int array[5];
int var_num = 0;
for(int i = 0; i < 26; i++){
if(current_var[i] == 0){
array[var_num] = i;
var_num++;
}
}
bool LOOP_FLG = false,HALT_FLG = false;
int line = 0;
int tmp_1,tmp_2;
int num[5];
while(true){
for(int i = 0; i < 5; i++)num[i] = 0;
for(int i = 0; i < var_num; i++){
num[i] = current_var[array[i]];
}
if(check[line][num[0]][num[1]][num[2]][num[3]][num[4]]){
LOOP_FLG = true;
break;
}else{
check[line][num[0]][num[1]][num[2]][num[3]][num[4]] = true;
}
if(LOOP_FLG)break;
switch(info[line].order){
case ADD:
tmp_1 = current_var[info[line].var2-'a'];
if(info[line].var3 == '@'){
tmp_2 = info[line].con;
}else{
tmp_2 = current_var[info[line].var3-'a'];
}
if(tmp_1+tmp_2 >= 16){
HALT_FLG = true;
}else{
current_var[info[line].var1-'a'] = tmp_1+tmp_2;
}
line++;
break;
case SUB:
tmp_1 = current_var[info[line].var2-'a'];
if(info[line].var3 == '@'){
tmp_2 = info[line].con;
}else{
tmp_2 = current_var[info[line].var3-'a'];
}
if(tmp_1-tmp_2 < 0){
HALT_FLG = true;
}else{
current_var[info[line].var1-'a'] = tmp_1-tmp_2;
}
line++;
break;
case SET:
if(info[line].var2 == '@'){
tmp_1 = info[line].con;
}else{
tmp_1 = current_var[info[line].var2-'a'];
}
current_var[info[line].var1-'a'] = tmp_1;
line++;
break;
case IF:
if(current_var[info[line].var1-'a'] == 0){
line++;
}else{
if(rev_line[info[line].con] == -1){
HALT_FLG = true;
}else{
line = rev_line[info[line].con];
}
}
break;
case HALT:
HALT_FLG = true;
break;
}
if(line == N || HALT_FLG == true)break;
}
if(LOOP_FLG){
printf("inf\n");
}else{
for(int i = 0; i < 26; i++){
if(current_var[i] != -1){
printf("%c=%d\n",'a'+i,current_var[i]);
}
}
}
return 0;
} |
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <bitset>
#define MAX_VALUE (1000 * 16 * 16 * 16 * 16 * 16)
enum cmd_t {
CMD_ADD,
CMD_SUB,
CMD_SET,
CMD_IF,
CMD_HALT
};
struct command {
cmd_t type;
int var1;
int var2;
int var3;
int opt;
};
struct vm_stat {
int pc;
int env[5];
vm_stat(void) {
pc = 0;
env[0] = 0;
env[1] = 0;
env[2] = 0;
env[3] = 0;
env[4] = 0;
}
size_t encode(void) {
int code = pc;
code = code * 16 + env[0];
code = code * 16 + env[1];
code = code * 16 + env[2];
code = code * 16 + env[3];
code = code * 16 + env[4];
return code;
}
};
static std::bitset<MAX_VALUE> stats;
static command plist[50];
static int n;
static int lines[1001];
int main(int argc, char* argv[]) {
int atom['z' - 'a' + 1];
int atom_n = 0;
for (int i = 'a'; i <= 'z'; ++i) {
atom[i - 'a'] = -1;
}
for (int i = 0; i <= 1000; ++i) {
lines[i] = -1;
}
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
char s[16];
int d;
scanf("%d", &d);
lines[d] = i;
scanf(" %s", s);
if (strcmp(s, "ADD") == 0) {
plist[i].type = CMD_ADD;
scanf(" %s", s);
if (atom[*s - 'a'] == -1) {
atom[*s - 'a'] = atom_n++;
}
plist[i].var1 = atom[*s - 'a'];
scanf(" %s", s);
if (atom[*s - 'a'] == -1) {
atom[*s - 'a'] = atom_n++;
}
plist[i].var2 = atom[*s - 'a'];
scanf(" %s", s);
if (isdigit(*s)) {
plist[i].var3 = -1;
plist[i].opt = atoi(s);
}
else {
if (atom[*s - 'a'] == -1) {
atom[*s - 'a'] = atom_n++;
}
plist[i].var3 = atom[*s - 'a'];
}
}
else if (strcmp(s, "SUB") == 0) {
plist[i].type = CMD_SUB;
scanf(" %s", s);
if (atom[*s - 'a'] == -1) {
atom[*s - 'a'] = atom_n++;
}
plist[i].var1 = atom[*s - 'a'];
scanf(" %s", s);
if (atom[*s - 'a'] == -1) {
atom[*s - 'a'] = atom_n++;
}
plist[i].var2 = atom[*s - 'a'];
scanf(" %s", s);
if (isdigit(*s)) {
plist[i].var3 = -1;
plist[i].opt = atoi(s);
}
else {
if (atom[*s - 'a'] == -1) {
atom[*s - 'a'] = atom_n++;
}
plist[i].var3 = atom[*s - 'a'];
}
}
else if (strcmp(s, "SET") == 0) {
plist[i].type = CMD_SET;
scanf(" %s", s);
if (atom[*s - 'a'] == -1) {
atom[*s - 'a'] = atom_n++;
}
plist[i].var1 = atom[*s - 'a'];
scanf(" %s", s);
if (isdigit(*s)) {
plist[i].var2 = -1;
plist[i].opt = atoi(s);
}
else {
if (atom[*s - 'a'] == -1) {
atom[*s - 'a'] = atom_n++;
}
plist[i].var2 = atom[*s - 'a'];
}
}
else if (strcmp(s, "IF") == 0) {
plist[i].type = CMD_IF;
scanf(" %s", s);
if (atom[*s - 'a'] == -1) {
atom[*s - 'a'] = atom_n++;
}
plist[i].var1 = atom[*s - 'a'];
scanf(" %d", &d);
plist[i].opt = d;
}
else {
plist[i].type = CMD_HALT;
}
}
vm_stat stat;
bool halted = true;
stats.set(stat.encode());
for (;;) {
const command c = plist[stat.pc++];
if (c.type == CMD_ADD) {
const int rvalue = stat.env[c.var2] + (c.var3 < 0 ? c.opt : stat.env[c.var3]);
if (rvalue < 0 || 16 <= rvalue) {
break;
}
stat.env[c.var1] = rvalue;
}
else if (c.type == CMD_SUB) {
const int rvalue = stat.env[c.var2] - (c.var3 < 0 ? c.opt : stat.env[c.var3]);
if (rvalue < 0 || 16 <= rvalue) {
break;
}
stat.env[c.var1] = rvalue;
}
else if (c.type == CMD_SET) {
if (c.var2 < 0) {
stat.env[c.var1] = c.opt;
}
else {
stat.env[c.var1] = stat.env[c.var2];
}
}
else if (c.type == CMD_IF) {
if (stat.env[c.var1]) {
if (lines[c.opt] == -1) {
break;
}
else {
stat.pc = lines[c.opt];
}
}
}
else {
break;
}
if (stats.test(stat.encode())) {
halted = false;
break;
}
if (stat.pc >= n) {
break;
}
stats.set(stat.encode());
}
if (halted) {
for (int i = 'a'; i <= 'z'; ++i) {
if (atom[i - 'a'] >= 0) {
printf("%c=%d\n", i, stat.env[atom[i - 'a']]);
}
}
}
else {
puts("inf");
}
return EXIT_SUCCESS;
}
|
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <iostream>
#include <set>
#include <map>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
enum ORDER{
ADD,
SUB,
SET,
IF,
HALT,
};
struct Info{
ORDER order;
char var1,var2,var3;
int con;
};
int current_var[26];
int line[50],rev_line[1001];
Info info[50];
bool check[50][16][16][16][16][16];
char table[50][51];
int main(){
for(int a = 0; a < 50; a++){
for(int b = 0; b < 16; b++){
for(int c = 0; c < 16; c++){
for(int d = 0; d < 16; d++){
for(int e = 0; e < 16; e++){
for(int f = 0; f < 16; f++){
check[a][b][c][d][e][f] = false;
}
}
}
}
}
}
for(int i = 0; i <= 1000; i++)rev_line[i] = -1;
for(int i = 0; i < 26; i++)current_var[i] = -1;
int N;
scanf("%d",&N);
getchar();
int tmp,index;
for(int i = 0; i < N; i++){
fgets(table[i],50,stdin);
tmp = 0;
for(index = 0; table[i][index] != ' '; index++){
tmp = 10*tmp+table[i][index]-'0';
}
line[i] = tmp;
rev_line[tmp] = i;
index++;
switch(table[i][index]){
case 'A': //ADD
info[i].order = ADD;
index += 4;
info[i].var1 = table[i][index];
current_var[info[i].var1-'a'] = 0;
index += 2;
info[i].var2 = table[i][index];
current_var[info[i].var2-'a'] = 0;
index += 2;
if(table[i][index] >= 'a' && table[i][index] <= 'z'){
info[i].var3 = table[i][index];
current_var[info[i].var3-'a'] = 0;
}else{
tmp = 0;
for(;table[i][index] >= '0' && table[i][index] <= '9';index++){
tmp = 10*tmp + table[i][index]-'0';
}
info[i].var3 = '@';
info[i].con = tmp;
}
break;
case 'S':
if(table[i][index+1] == 'U'){
info[i].order = SUB;
index += 4;
info[i].var1 = table[i][index];
current_var[info[i].var1-'a'] = 0;
index += 2;
info[i].var2 = table[i][index];
current_var[info[i].var2-'a'] = 0;
index += 2;
if(table[i][index] >= 'a' && table[i][index] <= 'z'){
info[i].var3 = table[i][index];
current_var[info[i].var3-'a'] = 0;
}else{
tmp = 0;
for(;table[i][index] >= '0' && table[i][index] <= '9';index++){
tmp = 10*tmp + table[i][index]-'0';
}
info[i].var3 = '@';
info[i].con = tmp;
}
}else{
info[i].order = SET;
index += 4;
info[i].var1 = table[i][index];
current_var[info[i].var1-'a'] = 0;
index += 2;
if(table[i][index] >= 'a' && table[i][index] <= 'z'){
info[i].var2 = table[i][index];
current_var[info[i].var2-'a'] = 0;
}else{
tmp = 0;
for(;table[i][index] >= '0' && table[i][index] <= '9';index++){
tmp = 10*tmp + table[i][index]-'0';
}
info[i].var2 = '@';
info[i].con = tmp;
}
}
break;
case 'I':
info[i].order = IF;
index += 3;
info[i].var1 = table[i][index];
current_var[info[i].var1-'a'] = 0;
index += 2;
tmp = 0;
for( ;table[i][index] >= '0' && table[i][index] <= '9'; index++){
tmp = 10*tmp+table[i][index]-'0';
}
info[i].con = tmp;
break;
case 'H':
info[i].order = HALT;
break;
}
}
int array[5];
int var_num = 0;
for(int i = 0; i < 26; i++){
if(current_var[i] == 0){
array[var_num] = i;
var_num++;
}
}
bool LOOP_FLG = false,HALT_FLG = false;
int line = 0;
int tmp_1,tmp_2;
int num[5];
while(true){
for(int i = 0; i < 5; i++)num[i] = 0;
for(int i = 0; i < var_num; i++){
num[i] = current_var[array[i]];
}
if(check[line][num[0]][num[1]][num[2]][num[3]][num[4]]){
LOOP_FLG = true;
break;
}else{
check[line][num[0]][num[1]][num[2]][num[3]][num[4]] = true;
}
switch(info[line].order){
case ADD:
tmp_1 = current_var[info[line].var2-'a'];
if(info[line].var3 == '@'){
tmp_2 = info[line].con;
}else{
tmp_2 = current_var[info[line].var3-'a'];
}
if(tmp_1+tmp_2 >= 16){
HALT_FLG = true;
}else{
current_var[info[line].var1-'a'] = tmp_1+tmp_2;
}
line++;
break;
case SUB:
tmp_1 = current_var[info[line].var2-'a'];
if(info[line].var3 == '@'){
tmp_2 = info[line].con;
}else{
tmp_2 = current_var[info[line].var3-'a'];
}
if(tmp_1-tmp_2 < 0){
HALT_FLG = true;
}else{
current_var[info[line].var1-'a'] = tmp_1-tmp_2;
}
line++;
break;
case SET:
if(info[line].var2 == '@'){
tmp_1 = info[line].con;
}else{
tmp_1 = current_var[info[line].var2-'a'];
}
current_var[info[line].var1-'a'] = tmp_1;
line++;
break;
case IF:
if(current_var[info[line].var1-'a'] == 0){
line++;
}else{
if(rev_line[info[line].con] == -1){
HALT_FLG = true;
}else{
line = rev_line[info[line].con];
}
}
break;
case HALT:
HALT_FLG = true;
break;
}
if(line == N || HALT_FLG == true)break;
}
if(LOOP_FLG){
printf("inf\n");
}else{
for(int i = 0; i < 26; i++){
if(current_var[i] != -1){
printf("%c=%d\n",'a'+i,current_var[i]);
}
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
typedef long long ll;
typedef pair<int, int> pii;
const ll INF = 1e9+100;
const ll MOD = 1e9+7;
const bool debug = 0;
int N;
int x[5];
int stmt[50][3], stk[50];
bool done[50][16][16][16][16][16];
map<char, int> hensu;
map<int, int> line;
int main() {
cin >> N;
vector<pair<int, string> > ord;
vector<char> c;
REP(i, N) {
int l;
scanf("%d ", &l);
string str;
getline(cin, str);
ord.push_back(make_pair(l, str));
stringstream ss(str);
while (ss) {
ss >> str;
if (str.size() == 1 && !isdigit(str[0])) c.push_back(str[0]);
}
}
sort(ALL(c)); c.erase(unique(ALL(c)), c.end());
REP(i, c.size()) hensu[c[i]] = i;
REP(i, ord.size()) line[ord[i].fi] = i;
REP(i, ord.size()) {
stringstream ss(ord[i].se);
string str;
ss >> str;
if (str == "ADD") {
ss >> str; stmt[i][0] = hensu[str[0]];
ss >> str; stmt[i][1] = hensu[str[0]];
ss >> str;
if (str.size() == 1 && !isdigit(str[0])) {
stk[i] = 0;
stmt[i][2] = hensu[str[0]];
}
else {
stk[i] = 1;
stmt[i][2] = atoi(str.c_str());
}
}
else if (str == "SUB") {
ss >> str; stmt[i][0] = hensu[str[0]];
ss >> str; stmt[i][1] = hensu[str[0]];
ss >> str;
if (str.size() == 1 && !isdigit(str[0])) {
stk[i] = 2;
stmt[i][2] = hensu[str[0]];
}
else {
stk[i] = 3;
stmt[i][2] = atoi(str.c_str());
}
}
else if (str == "SET") {
ss >> str; stmt[i][0] = hensu[str[0]];
ss >> str;
if (str.size() == 1 && !isdigit(str[0])) {
stk[i] = 4;
stmt[i][1] = hensu[str[0]];
}
else {
stk[i] = 5;
stmt[i][1] = atoi(str.c_str());
}
}
else if (str == "IF") {
ss >> str; stmt[i][0] = hensu[str[0]];
int dest; ss >> dest;
stmt[i][1] = dest;
stk[i] = 6;
}
else {
stk[i] = 7;
}
if (debug) printf("stk: %d, %d %d %d\n", stk[i], stmt[i][0], stmt[i][1], stmt[i][2]);
}
bool ng = false;
int p = 0;
while (p < N) {
if (stk[p] == 7) break;
if (!chmax(done[p][x[0]][x[1]][x[2]][x[3]][x[4]], true)) { ng = true; break; }
if (stk[p] == 6) {
if (x[stmt[p][0]]) {
if (!line.count(stmt[p][1])) p = N;
else p = line[stmt[p][1]];
}
else p++;
}
else {
int bef = x[stmt[p][0]];
switch (stk[p]) {
case 0: x[stmt[p][0]] = x[stmt[p][1]] + x[stmt[p][2]]; break;
case 1: x[stmt[p][0]] = x[stmt[p][1]] + stmt[p][2]; break;
case 2: x[stmt[p][0]] = x[stmt[p][1]] - x[stmt[p][2]]; break;
case 3: x[stmt[p][0]] = x[stmt[p][1]] - stmt[p][2]; break;
case 4: x[stmt[p][0]] = x[stmt[p][1]]; break;
case 5: x[stmt[p][0]] = stmt[p][1]; break;
}
if (x[stmt[p][0]] < 0 || x[stmt[p][0]] >= 16) {
x[stmt[p][0]] = bef;
p = N;
}
p++;
}
}
if (!ng) {
for (map<char, int>::iterator it = hensu.begin(); it != hensu.end(); ++it) {
printf("%c=%d\n", it->fi, x[it->se]);
}
}
else puts("inf");
return 0;
} |
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int main() {
int Q;
cin >> Q;
vector<int> ln(Q), c1(Q), c2(Q), c3(Q); vector<string> tp(Q), v1(Q), v2(Q), v3(Q);
vector<string> varlist;
function<bool(string)> is_number = [&](string str) {
for (int i = 0; i < str.size(); ++i) {
if (!('0' <= str[i] && str[i] <= '9')) {
return false;
}
}
return true;
};
function<int(string)> get_index = [&](string varname) {
int ptr = find(varlist.begin(), varlist.end(), varname) - varlist.begin();
return ptr;
};
for (int i = 0; i < Q; ++i) {
cin >> ln[i] >> tp[i];
if (tp[i] == "ADD" || tp[i] == "SUB") {
cin >> v1[i] >> v2[i] >> v3[i];
varlist.push_back(v1[i]);
if (!is_number(v2[i])) varlist.push_back(v2[i]);
if (!is_number(v3[i])) varlist.push_back(v3[i]);
}
if (tp[i] == "SET") {
cin >> v1[i] >> v2[i];
varlist.push_back(v1[i]);
if (!is_number(v2[i])) varlist.push_back(v2[i]);
}
if (tp[i] == "IF") {
cin >> v1[i] >> v2[i];
varlist.push_back(v1[i]);
}
if (tp[i] == "HALT") {
// input nothing
}
}
sort(varlist.begin(), varlist.end());
varlist.erase(unique(varlist.begin(), varlist.end()), varlist.end());
int S = varlist.size();
for (int i = 0; i < Q; ++i) {
if (tp[i] == "ADD" || tp[i] == "SUB") {
c1[i] = get_index(v1[i]) - S;
c2[i] = (is_number(v2[i]) ? stoi(v2[i]) : get_index(v2[i]) - S);
c3[i] = (is_number(v3[i]) ? stoi(v3[i]) : get_index(v3[i]) - S);
}
if (tp[i] == "SET") {
c1[i] = get_index(v1[i]) - S;
c2[i] = (is_number(v2[i]) ? stoi(v2[i]) : get_index(v2[i]) - S);
}
if (tp[i] == "IF") {
c1[i] = get_index(v1[i]) - S;
c2[i] = find(ln.begin(), ln.end(), stoi(v2[i])) - ln.begin(); // if not found, c2[i] will be Q
}
if (tp[i] == "HALT") {
// do nothing
}
}
vector<int> vars(S, 0);
int cur = 0;
bool halted = true;
vector<vector<bool> > vis(Q, vector<bool>(1 << (S * 4), false));
while (cur < Q) {
int h = 0;
for (int i = 0; i < S; ++i) {
h = h * 16 + vars[i];
}
if (vis[cur][h]) {
halted = false;
break;
}
vis[cur][h] = true;
vector<int> prevars = vars;
if (tp[cur] == "ADD") {
vars[c1[cur] + S] = (c2[cur] >= 0 ? c2[cur] : vars[c2[cur] + S]) + (c3[cur] >= 0 ? c3[cur] : vars[c3[cur] + S]);
}
if (tp[cur] == "SUB") {
vars[c1[cur] + S] = (c2[cur] >= 0 ? c2[cur] : vars[c2[cur] + S]) - (c3[cur] >= 0 ? c3[cur] : vars[c3[cur] + S]);
}
if (tp[cur] == "SET") {
vars[c1[cur] + S] = (c2[cur] >= 0 ? c2[cur] : vars[c2[cur] + S]);
}
if (tp[cur] == "IF") {
if (vars[c1[cur] + S] != 0) {
cur = c2[cur];
continue;
}
}
if (tp[cur] == "HALT") {
break;
}
if (vars[c1[cur] + S] < 0 || 16 <= vars[c1[cur] + S]) {
vars = prevars;
break;
}
++cur;
}
if (!halted) {
cout << "inf" << endl;
}
else {
for (int i = 0; i < S; ++i) {
cout << varlist[i] << "=" << vars[i] << endl;
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
string s;
int N;
cin >> N;
getline(cin, s);
unordered_map<string, int> index;
map<string, int> var;
vector<vector<string>> stmt(N, vector<string>(5));
for(auto i = 0; i < N; ++i) {
getline(cin, s);
stringstream ss(s);
ss >> stmt[i][0] >> stmt[i][1] >> stmt[i][2] >> stmt[i][3] >> stmt[i][4];
index[stmt[i][0]] = i;
int j = 0;
if(stmt[i][1] == "ADD" || stmt[i][1] == "SUB") j = 5;
if(stmt[i][1] == "SET") j = 4;
if(stmt[i][1] == "IF") j = 3;
while(2 <= --j) var[stmt[i][j]] = 0;
}
stmt.push_back({"", "HALT", "", ""});
for(s = "0"; s[0] <= '9'; ++s[0]) var[s] = s[0] - '0';
for(s = "10"; s[1] <= '5'; ++s[1]) var[s] = s[1] - '0' + 10;
auto valid = [](int n) {return 0 <= n && n < 16;};
int i = 0;
for(auto step = 0; ; ++step) {
if(52428800 < step) {
cout << "inf" << endl;
return 0;
}
auto& s = stmt[i++];
if(s[1] == "HALT") {
break;
} else if(s[1] == "IF") {
if(!var[s[2]]) continue;
if(!index.count(s[3])) break;
i = index[s[3]];
} else if(s[1] == "SET") {
var[s[2]] = var[s[3]];
} else if(s[1] == "ADD") {
if(!valid(var[s[3]] + var[s[4]])) break;
var[s[2]] = var[s[3]] + var[s[4]];
} else if(s[1] == "SUB") {
if(!valid(var[s[3]] - var[s[4]])) break;
var[s[2]] = var[s[3]] - var[s[4]];
}
}
for(s = "0"; s[0] <= '9'; ++s[0]) var.erase(s);
for(s = "10"; s[1] <= '5'; ++s[1]) var.erase(s);
for(auto i: var) cout << i.first << "=" << i.second << endl;
} |
#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;
enum OpeType_t
{
OPE_ADD_VAR,
OPE_ADD_CON,
OPE_SUB_VAR,
OPE_SUB_CON,
OPE_SET_VAR,
OPE_SET_CON,
OPE_IF,
OPE_HALT
};
int main()
{
int n;
cin >> n;
int m = 0;
int maxLoop = n;
vector<OpeType_t> opeType(n);
vector<vector<int> > arg(n);
vector<int> varIndex(128, -1);
vector<int> lineIndex(1001, -1);
for(int i=0; i<n; ++i){
int line;
string opeStr;
cin >> line >> opeStr;
lineIndex[line] = i;
int argNum;
if(opeStr == "ADD"){
opeType[i] = OPE_ADD_VAR;
argNum = 3;
}
else if(opeStr == "SUB"){
opeType[i] = OPE_SUB_VAR;
argNum = 3;
}
else if(opeStr == "SET"){
opeType[i] = OPE_SET_VAR;
argNum = 2;
}
else if(opeStr == "IF"){
opeType[i] = OPE_IF;
argNum = 2;
}
else{
opeType[i] = OPE_HALT;
argNum = 0;
}
arg[i].resize(argNum);
for(int j=0; j<argNum; ++j){
string s;
cin >> s;
if(isdigit(s[0])){
arg[i][j] = stoi(s);
if(opeType[i] != OPE_IF)
opeType[i] = (OpeType_t)((int)opeType[i] + 1);
}
else{
if(varIndex[s[0]] == -1){
varIndex[s[0]] = m;
++ m;
maxLoop *= 16;
}
arg[i][j] = varIndex[s[0]];
}
}
}
for(int i=0; i<n; ++i){
if(opeType[i] == OPE_IF)
arg[i][1] = lineIndex[arg[i][1]];
}
int curr = 0;
vector<int> var(m, 0);
while(--maxLoop >= 0){
bool isEnd = false;
vector<int> prevVar = var;
switch(opeType[curr]){
case OPE_ADD_VAR:
var[arg[curr][0]] = var[arg[curr][1]] + var[arg[curr][2]];
++ curr;
break;
case OPE_ADD_CON:
var[arg[curr][0]] = var[arg[curr][1]] + arg[curr][2];
++ curr;
break;
case OPE_SUB_VAR:
var[arg[curr][0]] = var[arg[curr][1]] - var[arg[curr][2]];
++ curr;
break;
case OPE_SUB_CON:
var[arg[curr][0]] = var[arg[curr][1]] - arg[curr][2];
++ curr;
break;
case OPE_SET_VAR:
var[arg[curr][0]] = var[arg[curr][1]];
++ curr;
break;
case OPE_SET_CON:
var[arg[curr][0]] = arg[curr][1];
++ curr;
break;
case OPE_IF:
if(var[arg[curr][0]] == 0)
++ curr;
else
curr = arg[curr][1];
break;
case OPE_HALT:
isEnd = true;
break;
}
if(!(0 <= curr && curr < n))
isEnd = true;
for(int i=0; i<m; ++i){
if(!(0 <= var[i] && var[i] < 16)){
var[i] = prevVar[i];
isEnd = true;
}
}
if(isEnd){
for(int i=0; i<128; ++i){
if(varIndex[i] != -1)
cout << (char)i << '=' << var[varIndex[i]] << endl;
}
return 0;
}
}
cout << "inf" << endl;
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define INF (1e9)
#define N 1005
using namespace std;
string s[N],s1[N],s2[N],s3[N];
set<char> S;
int n,num;
int d[N],p;
int var[N];
int get_num(string str){
if('a'<=str[0]&&str[0]<='z')return var[(int)str[0]];
int res=0;
rep(i,str.size())res=res*10+str[i]-'0';
return res;
}
void solve(){
int f=0,cnt=50000000;
while(1){
cnt--;
if(cnt==0)break;
if(s[p]=="ADD"){
int var2=get_num(s2[p]);
int var3=get_num(s3[p]);
if(var2+var3>=16){
f=1;
break;
}
var[(int)s1[p][0]]=var2+var3;
}
if(s[p]=="SUB"){
int var2=get_num(s2[p]);
int var3=get_num(s3[p]);
if(var2-var3<0){
f=1;
break;
}
var[(int)s1[p][0]]=var2-var3;
}
if(s[p]=="SET"){
int var2=get_num(s2[p]);
var[(int)s1[p][0]]=var2;
}
if(s[p]=="IF"){
int var1=get_num(s1[p]);
int var2=get_num(s2[p]);
if(var1!=0){
if(d[var2]==INF){
f=1;
break;
}
p=d[var2];
continue;
}
}
if(s[p]=="HALT"){
f=1;
break;
}
p++;
if(p==n){
f=1;
break;
}
}
if(f){
set<char>::iterator ite=S.begin();
while(ite!=S.end()){
cout<<(*ite)<<"="<<var[(int)(*ite)]<<endl;
ite++;
}
}else cout<<"inf"<<endl;
}
void add(char c){
if('a'<=c&&c<='z')S.insert(c);
}
int main(){
cin>>n;
rep(i,N)d[i]=INF;
rep(i,n){
cin>>num;
d[num]=i;
cin>>s[i];
if(s[i]=="HALT")continue;
cin>>s1[i]>>s2[i];
if(s[i]=="ADD"||s[i]=="SUB")cin>>s3[i],add(s3[i][0]);
add(s1[i][0]);
add(s2[i][0]);
}
solve();
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int N;
int s[100];
char t[100][10];
int u[100],v[100],w[100];
int num[1000];
int s2i(string str){
stringstream ss;
ss<<str;
int res;
ss>>res;
return res;
}
int change(int x){
if(0<=x){
return x;
}else{
return num[-x];
}
}
void setvalue(int x,int y){
assert( x<0 );
num[-x]=y;
}
int main(){
set<char> st;
map<int,int> lp;
scanf("%d",&N);
for(int i=0;i<N;i++){
scanf("%d",&s[i]);
assert( lp.count(s[i]) == 0 );
lp[ s[i] ] = i;
scanf("%s",t[i]);
char a[20],b[20],c[20];
if(t[i][0]=='A'){
scanf("%s %s %s",a,b,c);
if('a'<=a[0]&&a[0]<='z')u[i]=-1*(int)a[0],st.insert(a[0]);
else assert(0);
if('a'<=b[0]&&b[0]<='z')v[i]=-1*(int)b[0],st.insert(b[0]);
else v[i]=s2i(b);
if('a'<=c[0]&&c[0]<='z')w[i]=-1*(int)c[0],st.insert(c[0]);
else w[i]=s2i(c);
}else if(t[i][0]=='S'&&t[i][1]=='U'){
scanf("%s %s %s",a,b,c);
if('a'<=a[0]&&a[0]<='z')u[i]=-1*(int)a[0],st.insert(a[0]);
else assert(0);
if('a'<=b[0]&&b[0]<='z')v[i]=-1*(int)b[0],st.insert(b[0]);
else v[i]=s2i(b);
if('a'<=c[0]&&c[0]<='z')w[i]=-1*(int)c[0],st.insert(c[0]);
else w[i]=s2i(c);
}else if(t[i][0]=='S'&&t[i][1]=='E'){
scanf("%s %s",a,b);
if('a'<=a[0]&&a[0]<='z')u[i]=-1*(int)a[0],st.insert(a[0]);
else assert(0);
if('a'<=b[0]&&b[0]<='z')v[i]=-1*(int)b[0],st.insert(b[0]);
else v[i]=s2i(b);
}else if(t[i][0]=='I'){
scanf("%s %s",a,b);
if('a'<=a[0]&&a[0]<='z')u[i]=-1*(int)a[0],st.insert(a[0]);
else assert(0);
if('a'<=b[0]&&b[0]<='z')assert(0);
else v[i]=s2i(b);
}else if(t[i][0]=='H'){
}else assert(0);
}
int mx=30000000;
int p=0,cc=0;
while(cc < mx){
if(t[p][0]=='A'){
int value=change(v[p])+change(w[p]);
if(value<0 || 16<=value)break;
setvalue(u[p],value);
p++;
}else if(t[p][0]=='S'&&t[p][1]=='U'){
int value=change(v[p])-change(w[p]);
if(value<0 || 16<=value)break;
setvalue(u[p],value);
p++;
}else if(t[p][0]=='S'&&t[p][1]=='E'){
int value=change(v[p]);
if(value<0 || 16<=value)break;
setvalue(u[p],value);
p++;
}else if(t[p][0]=='I'){
int value=change(u[p]);
if(value > 0 ){
int next=change(v[p]);
if( lp.count( next ) == 0 )break;
p=lp[next];
}else{
p++;
}
}else if(t[p][0]=='H'){
break;
}else assert(0);
cc++;
if(p==N)break;
}
if(cc<mx){
set<char> :: iterator it;
for(it=st.begin();it!=st.end();it++){
int f=*it;
printf("%c=%d\n", *it, change(-f) );
}
}else{
printf("inf\n");
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
struct cmd{
int line;
string p;
vector<string>v;
};
vector<cmd> A;
map<int,int> idx;
map<string,int> var;
bool isNum(const string &a){return isdigit(a[0]);}
int StoI(const string &a){
int res=0;
for(int i=0;i<a.size();i++)res=res*10+a[i]-'0';
return res;
}
int ADD(string &a,string &b){
int res=0;
res+=var.count(a)? var[a]:StoI(a);
res+=var.count(b)? var[b]:StoI(b);
return res;
}
int SUB(string &a,string &b){
int res=0;
res+=var.count(a)? var[a]:StoI(a);
res-=var.count(b)? var[b]:StoI(b);
return res;
}
int SET(string &a){return var.count(a)? var[a]:StoI(a);}
bool start(){
int pos = 0,cnt=0;
while(1){
if(pos==(int)A.size())return 1;
if(cnt++>50000000) return 0;
cmd &a = A[pos];
string p = a.p;
if(p=="HALT") return 1;
if(p=="ADD") {
int res=ADD(a.v[1],a.v[2]);
if(res<0||res>=16) return 1;
var[a.v[0]]=res;
}
else if(p=="SUB"){
int res=SUB(a.v[1],a.v[2]);
if(res<0||res>=16) return 1;
var[a.v[0]]=res;
}
else if(p=="SET"){
int res=SET(a.v[1]);
if(res<0||res>=16) return 1;
var[a.v[0]]=res;
}
else if(p=="IF"&&var[a.v[0]]){
if(!idx.count(StoI(a.v[1])))return 1;
pos = idx[StoI(a.v[1])]-1;
}
pos++;
}
}
int main(){
int n;
cin>>n;
A.resize(n);
for(int i=0;i<n;i++){
cin>>A[i].line>>A[i].p;
idx[A[i].line]=i;
if(A[i].p=="HALT");
else if(A[i].p=="ADD"||A[i].p=="SUB")A[i].v.resize(3);
else A[i].v.resize(2);
for(int j=0;j<(int)A[i].v.size();j++) {
cin>>A[i].v[j];
if(!isNum(A[i].v[j]))var[A[i].v[j]] = 0;
}
}
if(!start())cout<<"inf"<<endl;
else
for(map<string,int>::iterator it=var.begin();it!=var.end();it++)
cout<<it->first<<"="<<it->second<<endl;
return 0;
} |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
int N;
map<int, int> lines;
string op[51], v1[51], v2[51], v3[51];
int env[256];
signed main() {
ios::sync_with_stdio(false); cin.tie(0);
cin >> N;
vector<char> var_names;
rep(i, N) {
int line;
cin >> line >> op[i];
lines[line] = i;
if (op[i] == "HALT") {}
else if (op[i] == "SET" || op[i] == "IF") cin >> v1[i] >> v2[i];
else cin >> v1[i] >> v2[i] >> v3[i];
if (v1[i].size() && !('0' <= v1[i][0] && v1[i][0] <= '9')) var_names.pb(v1[i][0]);
if (v2[i].size() && !('0' <= v2[i][0] && v2[i][0] <= '9')) var_names.pb(v2[i][0]);
if (v3[i].size() && !('0' <= v3[i][0] && v3[i][0] <= '9')) var_names.pb(v3[i][0]);
}
op[N] = "HALT";
rep(i, 256) env[i] = -1;
for (char s : var_names) env[s] = 0;
int steps = 0;
int cur = 0;
auto eval = [&](string s) {
if ('0' <= s[0] && s[0] <= '9') return stoi(s);
else return env[s[0]];
};
auto halt = [&]() {
rep(c, 256) {
if (env[c] == -1) continue;
cout << (char)c << "="<<env[c]<<"\n";
}
exit(0);
};
auto assign = [&](string s, int val) {
if (val < 0 || val >= 16) halt();
env[s[0]] = val;
};
while (steps++ <= (1<<20)*30) {
if (op[cur] == "ADD") {
assign(v1[cur], eval(v2[cur]) + eval(v3[cur]));
}
else if (op[cur] == "SUB") {
assign(v1[cur], eval(v2[cur]) - eval(v3[cur]));
}
else if (op[cur] == "SET") {
assign(v1[cur], eval(v2[cur]));
}
else if (op[cur] == "IF") {
if (lines.find(stoi(v2[cur])) == lines.end()) halt();
int dest = lines[stoi(v2[cur])];
if (eval(v1[cur]) != 0) {
cur = dest;
continue;
}
}
else if (op[cur] == "HALT") halt();
cur++;
}
cout << "inf\n";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int N;
int s[100];
char t[100][10];
int u[100],v[100],w[100];
int num[1000];
int s2i(string str){
stringstream ss;
ss<<str;
int res;
ss>>res;
return res;
}
int change(int x){
if(0<=x){
return x;
}else{
return num[-x];
}
}
void setvalue(int x,int y){
assert( x<0 );
num[-x]=y;
}
int main(){
set<char> st;
map<int,int> lp;
scanf("%d",&N);
for(int i=0;i<N;i++){
scanf("%d",&s[i]);
assert( lp.count(s[i]) == 0 );
lp[ s[i] ] = i;
scanf("%s",t[i]);
string a,b,c;
if(t[i][0]=='A'){
cin>>a>>b>>c;
if('a'<=a[0]&&a[0]<='z')u[i]=-1*(int)a[0],st.insert(a[0]);
else assert(0);
if('a'<=b[0]&&b[0]<='z')v[i]=-1*(int)b[0],st.insert(b[0]);
else v[i]=s2i(b);
if('a'<=c[0]&&c[0]<='z')w[i]=-1*(int)c[0],st.insert(c[0]);
else w[i]=s2i(c);
}else if(t[i][0]=='S'&&t[i][1]=='U'){
cin>>a>>b>>c;
if('a'<=a[0]&&a[0]<='z')u[i]=-1*(int)a[0],st.insert(a[0]);
else assert(0);
if('a'<=b[0]&&b[0]<='z')v[i]=-1*(int)b[0],st.insert(b[0]);
else v[i]=s2i(b);
if('a'<=c[0]&&c[0]<='z')w[i]=-1*(int)c[0],st.insert(c[0]);
else w[i]=s2i(c);
}else if(t[i][0]=='S'&&t[i][1]=='E'){
cin>>a>>b;
if('a'<=a[0]&&a[0]<='z')u[i]=-1*(int)a[0],st.insert(a[0]);
else assert(0);
if('a'<=b[0]&&b[0]<='z')v[i]=-1*(int)b[0],st.insert(b[0]);
else v[i]=s2i(b);
}else if(t[i][0]=='I'){
cin>>a>>b;
if('a'<=a[0]&&a[0]<='z')u[i]=-1*(int)a[0],st.insert(a[0]);
else assert(0);
if('a'<=b[0]&&b[0]<='z')assert(0);
else v[i]=s2i(b);
}else if(t[i][0]=='H'){
}else assert(0);
}
int mx=60000000;
int p=0,cc=0;
while(cc < mx){
if(t[p][0]=='A'){
int value=change(v[p])+change(w[p]);
if(value<0 || 16<=value)break;
setvalue(u[p],value);
p++;
}else if(t[p][0]=='S'&&t[p][1]=='U'){
int value=change(v[p])-change(w[p]);
if(value<0 || 16<=value)break;
setvalue(u[p],value);
p++;
}else if(t[p][0]=='S'&&t[p][1]=='E'){
int value=change(v[p]);
if(value<0 || 16<=value)break;
setvalue(u[p],value);
p++;
}else if(t[p][0]=='I'){
int value=change(u[p]);
if(value > 0 ){
int next=change(v[p]);
if( lp.count( next ) == 0 )break;
p=lp[next];
}else{
p++;
}
}else if(t[p][0]=='H'){
break;
}else assert(0);
cc++;
if(p==N)break;
}
if(cc<mx){
set<char> :: iterator it;
for(it=st.begin();it!=st.end();it++){
int f=*it;
printf("%c=%d\n", *it, change(-f) );
}
}else{
printf("inf\n");
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
unordered_map< string, int > ff;
void stop()
{
int ret = 0;
vector< pair< char, int > > vv;
for(auto &c : ff) if(isalpha(c.first[0])) vv.emplace_back(c.first[0], c.second);
sort(begin(vv), end(vv));
for(auto& c : vv) printf("%c=%d\n", c.first, c.second);
exit(0);
}
int main()
{
int N;
int convert[1001];
char buff[64], type[50][5], var1[50][5], var2[50][5], var3[50][5];
memset(convert, -1, sizeof(convert));
fgets(buff, sizeof(buff), stdin);
sscanf(buff, "%d", &N);
for(int i = 0; i < N; i++) {
int line;
fgets(buff, sizeof(buff), stdin);
sscanf(buff, "%d %s %s %s %s", &line, type[i], var1[i], var2[i], var3[i]);
convert[line] = i;
ff[var1[i]];
ff[var2[i]];
ff[var3[i]];
}
for(int i = 0; i < 16; i++) ff[to_string(i)] = i;
int i = 0;
for(int c = 0; c < 30000000; c++) {
if(type[i][0] == 'H') stop();
int val;
bool set = true;
if(type[i][0] == 'A') {
val = ff[var2[i]] + ff[var3[i]];
} else if(type[i][1] == 'U') {
val = ff[var2[i]] - ff[var3[i]];
} else if(type[i][1] == 'E') {
val = ff[var2[i]];
} else {
set = false;
}
if(set && (val < 0 || val >= 16)) stop();
if(set) ff[var1[i]] = val;
if(type[i][0] == 'I' && ff[var1[i]] != 0) {
i = convert[stoi(var2[i])];
} else {
i++;
}
if(i < 0 || i >= N) stop();
}
puts("inf");
} |
#include <bits/stdc++.h>
using namespace std;
int n;
struct Operator{
string id, ope, a, b, c;
};
Operator mei[100];
map<string, int> opeLine;
int used[300];
int hen_id[300];
char rhen_id[300];
int main(){
cin >> n;
for(int i = 0;i < n;i++){
string id, ope; cin >> id >> ope;
opeLine[id] = i;
if(ope == "ADD" || ope == "SUB"){
cin >> mei[i].a >> mei[i].b >> mei[i].c;
used[mei[i].a[0]] = 1;
used[mei[i].b[0]] = 1;
used[mei[i].c[0]] = 1;
}else if(ope == "SET" || ope == "IF"){
cin >> mei[i].a >> mei[i].b;
used[mei[i].a[0]] = 1;
used[mei[i].b[0]] = 1;
}
mei[i].id = id;
mei[i].ope = ope;
}
{
int tmp = 0;
for(int i = 'a';i <= 'z';i++){
if(used[i] == 1){
hen_id[i] = tmp;
rhen_id[tmp] = i;
tmp++;
}
}
}
int i = 0;
int cnt = 0;
int a[5] = {};
while(cnt < 60000000){
if(i == n) break;
if(mei[i].ope == "HALT") break;
if(mei[i].ope == "ADD"){
int x = hen_id[mei[i].a[0]];
int y = hen_id[mei[i].b[0]];
int tmp = 0;
if('0' <= mei[i].c[0] && mei[i].c[0] <= '9'){
tmp =a[y] + stoi(mei[i].c);
if(tmp >= 16) break;
}else{
int z = hen_id[mei[i].c[0]];
tmp = a[y] + a[z];
if(tmp >= 16) break;
}
a[x] = tmp;
}
if(mei[i].ope == "SUB"){
int x = hen_id[mei[i].a[0]];
int y = hen_id[mei[i].b[0]];
int tmp = 0;
if('0' <= mei[i].c[0] && mei[i].c[0] <= '9'){
tmp =a[y] - stoi(mei[i].c);
if(tmp < 0) break;
}else{
int z = hen_id[mei[i].c[0]];
tmp = a[y] - a[z];
if(tmp < 0) break;
}
a[x] = tmp;
}
if(mei[i].ope == "SET"){
int x = hen_id[mei[i].a[0]];
int tmp = 0;
if('0' <= mei[i].b[0] && mei[i].b[0] <= '9'){
tmp = stoi(mei[i].b);
}else{
int z = hen_id[mei[i].b[0]];
tmp = a[z];
}
a[x] = tmp;
}
if(mei[i].ope == "IF"){
int x = hen_id[mei[i].a[0]];
if(a[x] != 0){
if(opeLine.find(mei[i].b) != opeLine.end()){
i = opeLine[mei[i].b];
i--;
}else{
break;
}
}
}
cnt++;
i++;
}
if(cnt == 60000000) cout << "inf" << endl;
else{
for(int i = 0;i < 5;i++){
if(rhen_id[i] != 0){
cout << rhen_id[i] << "=" << a[i] << endl;
}
}
}
return 0;
}
|
#include <iostream>
#include <map>
#include <utility>
using namespace std;
struct line{
int type;
int con;
char c[3];
};
const int N=100;
int main(){
int n,t,cnt=0,temp;
map<int,int> m;
map<char,int>var;
line a[N];
string s;
cin>>n;
for(int i=0;i<n;i++){
cin>>t;
m.insert({t,i});
cin>>s;
if(s[0]=='H')a[i].type=0;
else if(s[0]=='A'){
cin>>s;
var.insert({s[0],0});
a[i].c[0]=s[0];
cin>>s;
var.insert({s[0],0});
a[i].c[1]=s[0];
cin>>s;
if('a'<=s[0]&&s[0]<='z'){
var.insert({s[0],0});
a[i].c[2]=s[0];
a[i].type=1;
}
else{
t=0;
for(char j:s){
t*=10;
t+=j-'0';
}
a[i].type=2;
a[i].con=t;
}
}
else if(s[1]=='E'){
cin>>s;
var.insert({s[0],0});
a[i].c[0]=s[0];
cin>>s;
if('a'<=s[0]&&s[0]<='z'){
var.insert({s[0],0});
a[i].c[1]=s[0];
a[i].type=3;
}
else{
t=0;
for(char j:s){
t*=10;
t+=j-'0';
}
a[i].type=4;
a[i].con=t;
}
}
else if(s[0]=='I'){
cin>>s;
var.insert({s[0],0});
a[i].c[0]=s[0];
cin>>a[i].con;
a[i].type=7;
}
else{
cin>>s;
var.insert({s[0],0});
a[i].c[0]=s[0];
cin>>s;
var.insert({s[0],0});
a[i].c[1]=s[0];
cin>>s;
if('a'<=s[0]&&s[0]<='z'){
var.insert({s[0],0});
a[i].c[2]=s[0];
a[i].type=5;
}
else{
t=0;
for(char j:s){
t*=10;
t+=j-'0';
}
a[i].type=6;
a[i].con=t;
}
}
}
t=0;
while(cnt<2e8){
cnt++;
if(t>=n||a[t].type==0)break;
else if(a[t].type==1){
temp=var[a[t].c[1]]+var[a[t].c[2]];
if(temp<0||temp>=16)break;
var[a[t].c[0]]=temp;
}
else if(a[t].type==2){
temp=var[a[t].c[1]]+a[t].con;
if(temp<0||temp>=16)break;
var[a[t].c[0]]=temp;
}
else if(a[t].type==3){
temp=var[a[t].c[1]];
if(temp<0||temp>=16)break;
var[a[t].c[0]]=temp;
}
else if(a[t].type==4){
temp=a[t].con;
if(temp<0||temp>=16)break;
var[a[t].c[0]]=temp;
}
else if(a[t].type==5){
temp=var[a[t].c[1]]-var[a[t].c[2]];
if(temp<0||temp>=16)break;
var[a[t].c[0]]=temp;
}
else if(a[t].type==6){
temp=var[a[t].c[1]]-a[t].con;
if(temp<0||temp>=16)break;
var[a[t].c[0]]=temp;
}
else{
if(var[a[t].c[0]]!=0){
if(m.find(a[t].con)==m.end())break;
else {
t=m[a[t].con];
continue;
}
}
}
t++;
}
if(cnt>=2e8)cout<<"inf"<<endl;
else for(pair<char,int> i:var)cout<<i.first<<"="<<i.second<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int N;
int s[100];
char t[100][10];
int u[100],v[100],w[100];
int num[1000];
int s2i(string str){
stringstream ss;
ss<<str;
int res;
ss>>res;
return res;
}
int change(int x){
if(0<=x){
return x;
}else{
return num[-x];
}
}
void setvalue(int x,int y){
assert( x<0 );
num[-x]=y;
}
int main(){
set<char> st;
map<int,int> lp;
scanf("%d",&N);
for(int i=0;i<N;i++){
scanf("%d",&s[i]);
assert( lp.count(s[i]) == 0 );
lp[ s[i] ] = i;
scanf("%s",t[i]);
char a[20],b[20],c[20];
if(t[i][0]=='A'){
scanf("%s %s %s",a,b,c);
if('a'<=a[0]&&a[0]<='z')u[i]=-1*(int)a[0],st.insert(a[0]);
else assert(0);
if('a'<=b[0]&&b[0]<='z')v[i]=-1*(int)b[0],st.insert(b[0]);
else v[i]=s2i(b);
if('a'<=c[0]&&c[0]<='z')w[i]=-1*(int)c[0],st.insert(c[0]);
else w[i]=s2i(c);
}else if(t[i][0]=='S'&&t[i][1]=='U'){
scanf("%s %s %s",a,b,c);
if('a'<=a[0]&&a[0]<='z')u[i]=-1*(int)a[0],st.insert(a[0]);
else assert(0);
if('a'<=b[0]&&b[0]<='z')v[i]=-1*(int)b[0],st.insert(b[0]);
else v[i]=s2i(b);
if('a'<=c[0]&&c[0]<='z')w[i]=-1*(int)c[0],st.insert(c[0]);
else w[i]=s2i(c);
}else if(t[i][0]=='S'&&t[i][1]=='E'){
scanf("%s %s",a,b);
if('a'<=a[0]&&a[0]<='z')u[i]=-1*(int)a[0],st.insert(a[0]);
else assert(0);
if('a'<=b[0]&&b[0]<='z')v[i]=-1*(int)b[0],st.insert(b[0]);
else v[i]=s2i(b);
}else if(t[i][0]=='I'){
scanf("%s %s",a,b);
if('a'<=a[0]&&a[0]<='z')u[i]=-1*(int)a[0],st.insert(a[0]);
else assert(0);
if('a'<=b[0]&&b[0]<='z')assert(0);
else v[i]=s2i(b);
}else if(t[i][0]=='H'){
}else assert(0);
}
int mx=50000000;
int p=0,cc=0;
while(cc < mx){
if(t[p][0]=='A'){
int value=change(v[p])+change(w[p]);
if(value<0 || 16<=value)break;
setvalue(u[p],value);
p++;
}else if(t[p][0]=='S'&&t[p][1]=='U'){
int value=change(v[p])-change(w[p]);
if(value<0 || 16<=value)break;
setvalue(u[p],value);
p++;
}else if(t[p][0]=='S'&&t[p][1]=='E'){
int value=change(v[p]);
if(value<0 || 16<=value)break;
setvalue(u[p],value);
p++;
}else if(t[p][0]=='I'){
int value=change(u[p]);
if(value > 0 ){
int next=change(v[p]);
if( lp.count( next ) == 0 )break;
p=lp[next];
}else{
p++;
}
}else if(t[p][0]=='H'){
break;
}else assert(0);
cc++;
if(p==N)break;
}
if(cc<mx){
set<char> :: iterator it;
for(it=st.begin();it!=st.end();it++){
int f=*it;
printf("%c=%d\n", *it, change(-f) );
}
}else{
printf("inf\n");
}
return 0;
} |
#include <bits/stdc++.h>
#ifdef DEBUG
#include "_debug.cpp"
#include "callable.hpp/callable.hpp"
#endif
#define endl '\n'
using namespace std;
using ll = long long;
#define N 5000
int g[N+1][N+1];
void add(int n, int i, int j, int v) {
if(1 <= i and i <= n and 1 <= j and j <= i) {
g[i][j] += v;
}
}
void update(int n, int a, int b, int x, int v = 1) {
add(n, a, b, v);
add(n, a, b + 1, -v);
add(n, a + x + 1, b, -v);
add(n, a + x + 1, b + x + 2, v);
add(n, a + x + 2, b + 1, v);
add(n, a + x + 2, b + x + 2, -v);
}
void sum(int n, int si, int sj, int di, int dj) {
for(int i = si; i <= n; i++) {
for(int j = sj; j <= i; j++) {
g[i][j] += g[i-di][j-dj];
}
}
}
void resolve(int n) {
sum(n, 1, 2, 0, 1);
sum(n, 2, 1, 1, 0);
sum(n, 2, 2, 1, 1);
}
template <typename Function>
void proc(int n, const Function& f) {
#ifdef DEBUG
using actual_type = typename callable_traits<Function>::function_type;
using expected_type = typename callable_traits<void(int, int)>::function_type;
static_assert(is_same<actual_type, expected_type>::value, "proc 'f' must be void(int, int)");
#endif
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
f(i, j);
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
memset(g, 0, sizeof g);
for(int i = 0; i < m; i++) {
int a, b, x;
cin >> a >> b >> x;
update(n, a, b, x);
}
resolve(n);
int ans = 0;
proc(n, [&](int i, int j) { ans += g[i][j] > 0; });
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int dat[5000*5001/2];
int conv(int y,int x){
return y*(y+1)/2+x;
}
int main(){
int N,M;
cin>>N>>M;
for(int i=0;i<M;i++){
int y,x,d;
cin>>y>>x>>d;
y--;x--;
int idx=conv(y,x);
dat[idx]=max(dat[idx],d+1);
}
for(int i=0;i<N-1;i++){
for(int j=0;j<=i;j++){
int idx=conv(i,j);
int l=conv(i+1,j);
int r=conv(i+1,j+1);
dat[l]=max(dat[l],dat[idx]-1);
dat[r]=max(dat[r],dat[idx]-1);
}
}
int ans=0;
for(int i=0;i<N*(N+1)/2;i++)if(dat[i])ans++;
cout<<ans<<endl;
return 0;
} |
#include <cstdio>
#include <iostream>
#include <vector>
#include <list>
#include <cmath>
#include <fstream>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <iterator>
#include <cstdlib>
#include <cstring>
#include <sstream>
using namespace std;
const double EPS=(1e-10);
typedef long long ll;
typedef pair<int,int> pii;
bool EQ(double a,double b){
return abs((a)-(b))<EPS;
}
void fast_stream(){
std::ios_base::sync_with_stdio(0);
}
short dp[5001][5001];
void dfs(int x,int y,int depth){
if(dp[y][x]>=depth)return;
dp[y][x]=depth;
if(depth==0)return;
int ny=y+1;
int nx=x+1;
dfs(nx,ny,depth-1);
ny=y;
dfs(nx,ny,depth-1);
}
void solve(){
memset(dp,-1,sizeof(dp));
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++){
int x,y,a;
cin>>x>>y>>a;
dfs(x,y,a);
}
int cnt=0;
for(int i=0;i<=n;i++){
for(int j=0;j<=n;j++){
if(dp[j][i]>=0)cnt++;
}
}
cout<<cnt<<endl;
}
int main(){
solve();
return 0;
} |
//Bokan ga bokka--nn!!
//Daily Lunch Special Tanoshii !!
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
typedef long long ll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 2000000000
#define s(x) scanf("%d",&x)
#define rep(i,x) for(int i=0;i<x;i++)
short v[5005][5005]={};
int main()
{
int n,m;
scanf("%d %d",&n,&m);
for(int i=1;i<=m;i++)
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
v[a][b]=max(v[a][b],(short)(c+1));
}
int ret=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
{
v[i][j]=max(v[i][j],(short)(max(v[i-1][j-1],v[i-1][j])-1));
if(v[i][j]) ret++;
}
}
printf("%d\n",ret);
} |
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
//// < "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\a.txt" > "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\b.answer"
int main() {
int N; cin >> N; int M; cin >> M;
vector<vector<pair<int,int>>>pluss(N, vector<pair<int,int>>(N+1));
vector<vector<int>>aas(N, vector<int>(N + 1));
for (int i = 0; i < M; ++i) {
int a, b, x; cin >> a >> b >> x;
a--; b--;
pluss[a + x][b].first++;
pluss[a + x][b + x+1].second++;
if (a) {
aas[a - 1][b]++;
}
}
for (int h = N - 1; h >= 0; --h) {
for (int w = 0; w <= h + 1; ++w) {
if (h != N - 1) {
pluss[h][w].first += pluss[h + 1][w].first;
pluss[h][w].second += pluss[h + 1][w + 1].second;
}
pluss[h][w].first -= aas[h][w];
pluss[h][w].second -= aas[h][w];
}
}
int ans = 0;
for (int h = N - 1; h >= 0; --h) {
int sum = 0;
for (int w = 0; w <= h; ++w) {
sum += pluss[h][w].first - pluss[h][w].second;
if (sum>0)ans++;
}
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PB push_back
#define MK make_pair
#define MKT make_tuple
#define ALL(V) V.begin(), V.end()
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, pii> pipi;
constexpr int INF = 1LL<<60;
//constexpr int INF = 1<<28;
constexpr int MOD = 1000000007;
constexpr int MAX_N = 5005;
constexpr int dx[] = {-1, 0, 1, 0};
constexpr int dy[] = {0, -1, 0, 1};
int imos[2][MAX_N][MAX_N], n, m;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int a, b, x;
cin >> a >> b >> x;
imos[0][b][a]++;
imos[0][b][a + x + 1]--;
imos[1][b + 1][a]--;
imos[1][b + x + 2][a + x + 1]++;
}
for (int x = 1; x <= n; ++x) {
for (int y = 1; y <= n; ++y) {
imos[0][x][y] += imos[0][x][y - 1];
}
}
for (int y = 1; y <= n; ++y) {
for (int x = 1; x <= n && x + y - 1 <= n; ++x) {
imos[1][x][x + y - 1] += imos[1][x - 1][x + y - 2];
}
}
int ans = 0;
for (int y = 1; y <= n; ++y) {
int sum = 0;
for (int x = 1; x <= y; ++x) {
sum += imos[0][x][y] + imos[1][x][y];
//dbg
imos[0][x][y] = sum;
if (0 < sum) ans++;
}
}
cout << ans << endl;
} |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
using namespace std;
typedef pair<int,int> p;
typedef pair<int,p> P;
typedef pair<p,p> p2;
#define pu push
#define pb push_back
#define mp make_pair
short field[5005][5005]={};
int main(){
int n,m;
scanf("%d %d",&n,&m);
for(int i=0;i<m;i++){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
field[a][b]=(short)c+1;
}
for(int i=1;i<n;i++){
for(int j=1;j<=n;j++){
if(field[i][j]>0){
field[i+1][j]=max((int)field[i+1][j],(int)field[i][j]-1);
if(j!=n){
field[i+1][j+1]=max((int)field[i+1][j+1],(int)field[i][j]-1);
}
}
}
}
int ans=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(field[i][j]>0){
ans++;
}
}
}
printf("%d\n",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define chmax(x, y) (x = max<int>(x, y))
int n, m;
int16_t dp[5010][5010];
int main()
{
cin >> n >> m;
for (int i = 0; i < m; i++){
int a, b, x;
cin >> a >> b >> x;
chmax(dp[a - 1][b - 1], x + 1);
}
for (int i = 0; i < n; i++){
for (int j = 0; j <= i; j++){
chmax(dp[i + 1][j], dp[i][j] - 1);
chmax(dp[i + 1][j + 1], dp[i][j] - 1);
}
}
int res = 0;
for (int i = 0; i < n; i++){
for (int j = 0; j <= i; j++){
res += dp[i][j] > 0;
}
}
cout << res << endl;
} |
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define INF (2 << 28)
#define fr first
#define sc second
using namespace std;
typedef long long ll;
typedef pair<int, int> iP;
unsigned short dp[5011][5011];
int main(){
int n, m;
cin >> n >> m;
for(int i = 0; i < m; i++){
int a, b, c; cin >> a >> b >> c;
dp[a][b] = c + 1;
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= i; j++){
if(dp[i][j]){
dp[i + 1][j] = max< unsigned short >(dp[i + 1][j], dp[i][j] - 1);
dp[i + 1][j + 1] = max< unsigned short >(dp[i + 1][j + 1], dp[i][j] - 1);
}
}
}
ll sum = 0;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= i; j++){
if(dp[i][j]) sum++;
}
}
cout << sum << endl;
} |
#include <bits/stdc++.h>
#define FOR(i,n) for(int i=0;i<(int)(n);i++)
#define FORR(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define pb(a) push_back(a)
#define mp(x,y) make_pair(x,y)
#define ALL(a) a.begin(),a.end()
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,-1,sizeof(a))
#define len(a) sizeof(a)
#define ll long long
#define pii pair<int,int>
#define INF 1<<29
#define MAX
using namespace std;
int n,m,a,b,x;
vector<vector<int>> imos;
void solve(){
scanf("%d%d",&n,&m);
imos.resize(n+2);
FOR(i,n+2) imos[i].assign(i+2,0);
FOR(i,m){
scanf("%d%d%d",&a,&b,&x);
a--; b--;
imos[a][b]++;
imos[a][b+1]--;
imos[a+x+1][b]--;
imos[a+x+2][b+1]++;
imos[a+x+1][b+x+2]++;
imos[a+x+2][b+x+2]--;
}
FOR(i,n) FOR(j,i+1) imos[i][j+1]+=imos[i][j];
FOR(i,n) FOR(j,i+1) imos[i+1][j]+=imos[i][j];
FOR(i,n) FOR(j,i+1) imos[i+1][j+1]+=imos[i][j];
int ct=0;
FOR(i,n) FOR(j,i+1) if(imos[i][j]) ct++;
printf("%d\n",ct);
}
int main(){
solve();
return 0;
} |
#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
using namespace std;
#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
template<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<" "; cerr<<endl; }
inline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }
typedef long long ll;
const int INF = 100000000;
const double EPS = 1e-8;
const int MOD = 1000000007;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int f(int y, int x){
return 2 * y + y * (y + 1) / 2 + x;
}
int table[18000000];
int main(){
int N, M;
while(cin >> N >> M && N){
REP(i, M){
int Y, X, L;
scanf("%d %d %d", &Y, &X, &L);
Y--; X--;
table[f(Y, X)]++;
table[f(Y, X + 1)]--;
table[f(Y + L + 1, X)]--;
table[f(Y + L + 1, X + L + 2)]++;
table[f(Y + L + 2, X + 1)]++;
table[f(Y + L + 2, X + L + 2)]--;
}
for(int y = 0; y < N + 2; y++){
for(int x = 1; x <= y + 2; x++){
table[f(y, x)] += table[f(y, x - 1)];
}
}
for(int y = 1; y < N + 2; y++){
for(int x = 0; x <= y + 1; x++){
table[f(y, x)] += table[f(y - 1, x)];
}
}
for(int y = 1; y < N + 2; y++){
for(int x = 1; x <= y + 2; x++){
table[f(y, x)] += table[f(y - 1, x - 1)];
}
}
int ans = 0;
for(int y = 0; y < N; y++){
for(int x = 0; x <= y; x++){
if(table[f(y, x)] > 0) ans++;
}
}
cout << ans << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
const int N=5005;
int v[N][N]={}, d[N][N]={}, s[N][N];
int main()
{
int n,m;
scanf(" %d %d", &n, &m);
while(m--)
{
int a,b,x;
scanf(" %d %d %d", &a, &b, &x);
--a;
--b;
++v[a][b];
--v[a+x+1][b];
--d[a][b+1];
++d[a+x+1][b+x+2];
}
rep(i,N)for(int j=1; j<N; ++j) v[j][i] += v[j-1][i];
rep(i,N)for(int j=1; i+j<N; ++j) d[i+j][j] += d[i+j-1][j-1];
for(int j=1; 1+j<N; ++j) d[j][1+j] += d[j-1][1+j-1];
rep(i,N)rep(j,N) s[i][j] = v[i][j]+d[i][j];
rep(i,N)for(int j=1; j<N; ++j) s[i][j] += s[i][j-1];
int ans=0;
rep(i,n)rep(j,i+1) ans+=s[i][j]>0;
printf("%d\n", ans);
return 0;
} |
#include<iostream>
#include<algorithm>
#include<vector>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rec(i,m,n) for(int i = m; i < n; ++i)
using namespace std;
int main(void)
{
int N,M;
int A,B,X;
cin >> N >> M;
//vector<vector<int> > pos(N + 3,vector<int>(N + 3));
vector< vector<int> > pos(N + 5);
rep(i, N + 5) pos[i].assign(i + 5, 0);
rep(i,M)
{
cin >> A >> B >> X;
pos[A][B]++;
pos[A][B+1]--;
pos[A+X+2][B+1]++;
pos[A+X+1][B]--;
pos[A+X+1][B+X+2]++;
pos[A+X+2][B+X+2]--;
}
rec(y,1,N+1)
rep(x,y+2)
if(x > 1)
pos[y][x] += pos[y][x-1];
rec(x,1,N+2)
rec(y,x,N+2)
if(y != x)
pos[y][x] += pos[y-1][x];
rep(i,N+2)
for(int j=0; i+j < N+2;++j)
if(j > 1 && j + i > 1)
pos[i+j][j] += pos[i+j-1][j-1];
int ans = 0;
rep(i,N+1)
rep(j,i+1)
if(pos[i][j] > 0)
ans++;
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
using namespace std;
int N, M;
int d[5010][5010];
int main() {
cin >> N >> M;
for (int i=0; i<M; i++) {
int a, b, x;
cin >> a >> b >> x;
a--;
b--;
d[a][b] += 1;
d[a][b+1] -= 1;
d[a+x+1][b] -= 1;
d[a+x+2][b+1] += 1;
d[a+x+1][b+x+2] += 1;
d[a+x+2][b+x+1+1] -= 1;
}
for (int i=1; i<=N; i++) {
for (int j=1; j<=N; j++) {
d[i][j] += d[i-1][j-1];
}
}
for (int i=1; i<=N; i++) {
for (int j=0; j<=N; j++) {
d[i][j] += d[i-1][j];
}
}
for (int i=0; i<=N; i++) {
for (int j=1; j<=N; j++) {
d[i][j] += d[i][j-1];
}
}
int ans = 0;
for (int i=0; i<N; i++) {
for (int j=0; j<=i; j++) {
if (d[i][j] > 0) ans++;
}
}
cout << ans << "\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
//int tri[5010][5010];
vector<int> tri[5010];
int main()
{
for (int i = 0; i < 5010; i++){
tri[i].reserve(i + 1);
for (int j = 0; j <= i; j++){
tri[i][j] = 0;
}
}
int n, m;
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++){
int a, b, x;
scanf("%d %d %d", &a, &b, &x);
a++;
tri[a][b]++;
tri[a][b + 1]--;
tri[a + x + 1][b]--;
tri[a + x + 2][b + 1]++;
tri[a + x + 1][b + x + 2]++;
tri[a + x + 2][b + x + 2]--;
}
for (int i = 0; i <= n + 3; i++){
for (int j = 0; j <= i; j++){
//printf("%d ", tri[i][j]);
}
//puts("");
}
for (int i = 0; i <= n + 3; i++){
for (int j = 1; j <= i; j++){
tri[i][j] += tri[i][j - 1];
}
}
for (int i = 1; i <= n + 3; i++){
for (int j = 1; j <= i - 1; j++){
tri[i][j] += tri[i - 1][j];
}
}
for (int i = 1; i <= n + 3; i++){
for (int j = 1; j <= i; j++){
tri[i][j] += tri[i - 1][j - 1];
}
}
int cnt = 0;
for (int i = 2; i <= n + 1; i++){
for (int j = 1; j <= i - 1; j++){
cnt += !!tri[i][j];
//printf("%d ", tri[i][j]);
}
//puts("");
}
printf("%d\n", cnt);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
static vector< int > sum[5011];
int main(){
for(int i = 0; i <= 5010 ; i++){
sum[i].resize(i + 10, 0);
}
int N, M;
cin >> N >> M;
for(int i = 0; i < M; i++){
int a, b, x;
cin >> a >> b >> x;
++sum[a][b];
--sum[a][b + 1];
++sum[a + x + 1][b + x + 2];
--sum[a + x + 2][b + x + 2];
++sum[a + x + 2][b + 1];
--sum[a + x + 1][b];
}
for(int i = 1; i <= N + 10; i++){
for(int j = 1; j <= i + 5; j++){
sum[i][j] += sum[i - 1][j - 1];
}
}
for(int i = 1 ; i <= N + 10 ; i++){
for(int j = 1 ; j <= i + 5; j++){
sum[i][j] += sum[i][j - 1];
}
}
for(int i = 1; i <= N + 10; i++){
for(int j = 1; j <= i + 5; j++){
sum[i][j] += sum[i - 1][j];
}
}
int ret = 0, cnt = 0;
for(int i = 1; i <= N; i++){
for(int j = 1; j <= i; j++){
if(sum[i][j] != 0) ret++;
}
}
cout << ret << endl;
} |
#include <cstdio>
#include <algorithm>
using namespace std;
int tri[5002][5002];
int main() {
int n,m; scanf("%d%d",&n,&m);
for (int i=0; i<m; i++) {
int x, y, r; scanf("%d%d%d",&x,&y,&r);
tri[x-1][y-1]=max(tri[x-1][y-1],r+1);
}
for (int i=1; i<n; i++) {
tri[i][0]=max(tri[i-1][0]-1, tri[i][0]);
tri[i][i]=max(tri[i-1][i-1]-1,tri[i][i]);
for (int j=1; j<i; j++) {
tri[i][j]=max(tri[i][j], max(tri[i-1][j-1],tri[i-1][j])-1);
}
}
int res=0;
for (int i=0; i<n; i++) {
for (int j=0; j<=i; j++) {
if (tri[i][j]!=0) res++;
}
}
printf("%d\n",res);
} |
#include <bits/stdc++.h>
using namespace std;
//int d[5500][5500];
int main(){
int n,m;
scanf("%d%d",&n,&m);
vector<int> d[n+10];
for(int i = 0;i < n+5;i++)d[i].resize(i+10);
for(int i = 0;i < n+5;i++)
for(int j = 0;j < i+1;j++)
d[i][j] = 0;
for(int i = 0;i < m;i++){
int a,b,x;
scanf("%d%d%d",&a,&b,&x);
d[a][b]++;
d[a][b+1]--;
d[a+x+1][b]--;
d[a+x+2][b+1]++;
d[a+x+1][b+x+2]++;
d[a+x+2][b+x+2]--;
}
for(int i = 0;i <= n;i++){
for(int j = 1;j <= i+2;j++){
d[i][j] += d[i][j-1];
}
}
for(int i = 1;i <= n;i++){
for(int j = 0;j <= i+2;j++){
d[i][j] += d[i-1][j];
}
}
for(int i = 1;i <= n;i++){
for(int j = 1;j <= i+2;j++){
d[i][j] += d[i-1][j-1];
}
}
int ans = 0;
for(int i = 0;i <= n;i++){
for(int j = 0;j <= i+2;j++){
if(d[i][j] > 0)ans++;
}
}
printf("%d\n",ans);
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int n,m,ans=0;
int tri[5001][5001];
int main(void){
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++){
int x,y,size;
scanf("%d%d%d",&y,&x,&size);
tri[x][y]=size+1;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
tri[j][i]=max(tri[j][i],max(tri[j-1][i-1],tri[j][i-1])-1);
if(tri[j][i]>0)ans++;
}
}
printf("%d\n",ans);
return 0;
} |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
//int dy[]={0, 0, 1, -1, 0};
//int dx[]={1, -1, 0, 0, 0};
int main(){
int n, m;
scanf("%d%d", &n, &m);
vector<vector<int> > imos(5010, vector<int>(5010, 0));
REP(i, m){
int a, b, x;
scanf("%d%d%d", &a, &b, &x);
a--; b--;
imos[a][b]+=1;
imos[a][b+1]-=1;
imos[a+x+1][b]-=1;
imos[a+x+1][b+x+2]+=1;
imos[a+x+2][b+1]+=1;
imos[a+x+2][b+x+2]-=1;
}
REP(i, n+5){
REP(j, n+5){
if(j>0) imos[i][j]+=imos[i][j-1];
}
}
REP(i, n+5){
REP(j, n+5){
if(i>0) imos[i][j]+=imos[i-1][j];
}
}
REP(i, n+5){
REP(j, n+5){
if(i>0 && j>0) imos[i][j]+=imos[i-1][j-1];
}
}
int ans=0;
REP(i, n+5){
REP(j, n+5){
if(imos[i][j]>0) ans++;
}
}
printf("%d\n", ans);
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector< vector<int> > imos(n + 2, vector<int>(n + 2, 0));
for(int i = 0 ; i < m ; ++i){
int a, b, x;
cin >> a >> b >> x;
--a;
--b;
++imos[a][b];
--imos[a][b + 1];
--imos[a + x + 1][b];
++imos[a + x + 1][b + x + 2];
++imos[a + x + 2][b + 1];
--imos[a + x + 2][b + x + 2];
}
for(int i = 0 ; i < n + 2 ; ++i){
for(int j = 1 ; j < n + 2 ; ++j){
imos[i][j] += imos[i][j - 1];
}
}
for(int j = 0 ; j < n + 2 ; ++j){
for(int i = 1 ; i < n + 2 ; ++i){
imos[i][j] += imos[i - 1][j];
}
}
for(int i = n - 2 ; i > 0 ; --i){
int y = i + 1, x = 1;
while(y < n + 2 && x < n + 2){
imos[y][x] += imos[y - 1][x - 1];
++y;
++x;
}
}
for(int j = 0 ; j < n + 2 ; ++j){
int y = 1, x = j + 1;
while(y < n + 2 && x < n + 2){
imos[y][x] += imos[y - 1][x - 1];
++y;
++x;
}
}
int ans = 0;
for(int i = 0 ; i < n ; ++i){
for(int j = 0 ; j < n ; ++j){
if(imos[i][j] > 0){
++ans;
}
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
short nail[5001][5001];
int main()
{
int N, M;
cin >> N >> M;
for(int i = 0; i < M; i++) {
int a, b, x;
cin >> a >> b >> x;
--a, --b; ++x;
nail[a][b] = max< short >(nail[a][b], x);
}
int ret = nail[0][0] > 0;
for(int i = 1; i < N; i++) {
for(int j = 0; j <= i; j++) {
nail[i][j] = max< short >(nail[i][j], max(nail[i - 1][max(0, j - 1)], nail[i - 1][j]) - 1);
ret += nail[i][j] > 0;
}
}
cout << ret << endl;
} |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
using namespace std;
int INC[5100][5100] = {};
int DEC[5100][5100] = {};
int main() {
int N, M;
cin >> N >> M;
for(int i = 0; i < M; i++){
int A, B, X;
cin >> A >> B >> X;
A = A - B + 1;
INC[A][B]++;
INC[A + X + 1][B]--;
DEC[A - 1][B + 1]++;
DEC[A - 1][B + X + 2]--;
}
for(int i = 0; i <= N + 1; i++){
int ret = 0;
int ret2 = 0;
for(int j = 0; j <= N + 1; j++){
ret += DEC[i][j];
DEC[i][j] = ret;
ret2 += INC[j][i];
INC[j][i] = ret2;
}
}
/*
for(int i = 0; i <= N + 1; i++){
for(int j = 0; j <= N + 1; j++){
cout << INC[i][j] << " ";
}
cout << endl;
}
for(int i = 0; i <= N + 1; i++){
for(int j = 0; j <= N + 1; j++){
cout << DEC[i][j] << " ";
}
cout << endl;
}
*/
int ans = 0;
for(int i = 0; i <= N + 1; i++){
int ret = 0;
for(int j = 1; j <= i - 1; j++){
int id1 = i - j;
int id2 = j;
ret += INC[id1][id2];
ret -= DEC[id1][id2];
if(ret > 0){
ans++;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define PW(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define MODU 1000000007
#define bitcheck(a,b) ((a >> b) & 1)
#define bitset(a,b) ( a |= (1 << b))
#define bitunset(a,b) (a &= ~(1 << b))
#define MP(a,b) make_pair((a),(b))
#define Manh(a,b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a%b);
}
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
std::fill((T*) array, (T*) (array + N), val);
}
pii Dir [] = {
{ 0, 1 },{ -1 ,1 },{ -1, 0 },
{ -1 ,-1 },{ 0,-1 },{ 1 ,-1 },
{ 1,0 },{ 1 ,1 }
};
signed main() {
int n, m;
scanf("%d %d", &n, &m);
vector<vector<int>> tri(n+3, vector<int>(n+3,0));
REP(i, m) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
a--; b--;
tri[a][b] += 1;
tri[a][b + 1] += -1;
tri[a + c + 1][b] += -1;
tri[a + c + 2][b+1] += 1;
tri[a + c + 1][b+c+2] += 1;
tri[a + c + 2][b +c+2] += -1;
}
REP(i, n+2) {
REP(j, n+2) {
tri[i][j + 1] += tri[i][j];
}
}
REP(i, n + 2) {
REP(j, n + 2) {
tri[j+1][i] += tri[j][i];
}
}
REP(i, n + 2) {
REP(j, n + 2) {
tri[i+1][j + 1] += tri[i][j];
}
}
int ans = 0;
REP(i, n) {
REP(j, n) {
ans += (bool)tri[i][j];
}
}
printf("%d\n", ans);
return 0;
} |
#include<iostream>
#include<algorithm>
#include<string>
#include<map>
#include<vector>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int imos[5010][5010];
void disp(int n) {
for (int i = 0; i <= n + 1; i++) {
for (int j = 0; j <= n + 1; j++) {
cout << imos[i][j] << ' ';
}
cout << endl;
}
}
signed main() {
int n, m; cin >> n >> m;
rep(i, m) {
int a, b, x; cin >> a >> b >> x;
imos[a][b]++;
imos[a][b + 1]--;
imos[a + x + 1][b]--;
imos[a + x + 1][b + x + 2]++;
imos[a + x + 2][b + 1]++;
imos[a + x + 2][b + x + 2]--;
}
rep(i, n + 3)rep(j, n + 3)imos[i][j + 1] += imos[i][j];
rep(i, n + 3)rep(j, n + 3)imos[i + 1][j] += imos[i][j];
rep(i, n + 3)rep(j, n + 3)imos[i + 1][j + 1] += imos[i][j];
int cnt = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
if (imos[i][j]>0)cnt++;
}
}
cout << cnt << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, M; cin >> N >> M;
vector<int> A(M), B(M), X(M);
vector<vector<int>> table(N+3);
for(int i=0; i<table.size(); i++){
for(int j=0; j<=i; j++){
table[i].push_back(0);
}
}
for(int i=0; i<M; i++){
cin >> A[i] >> B[i] >> X[i];
B[i]--;
table[A[i]][B[i]]++;
table[A[i]][B[i]+1]--;
table[A[i]+X[i]+1][B[i]]--;
table[A[i]+X[i]+2][B[i]+1]++;
table[A[i]+X[i]+1][B[i]+X[i]+2]++;
table[A[i]+X[i]+2][B[i]+X[i]+2]--;
}
for(int i=0; i<table.size(); i++){
for(int j=1; j<=i; j++){
table[i][j]+=table[i][j-1];
}
}
for(int i=1; i<table.size(); i++){
for(int j=0; j<i; j++){
table[i][j]+=table[i-1][j];
}
}
for(int i=1; i<table.size(); i++){
for(int j=1; j<=i; j++){
table[i][j]+=table[i-1][j-1];
}
}
int cnt=0;
for(int i=0; i<table.size(); i++){
for(int j=0; j<=i; j++){
if(table[i][j] > 0) cnt++;
}
}
cout << cnt << endl;
return 0;
}
|
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<pair<int, int> > > G(N);
for (int i = 0; i < M; ++i) {
int A, B, X;
cin >> A >> B >> X;
G[A - 1].push_back(make_pair(B - 1, X + 1));
}
vector<int> dp;
int ans = 0;
for (int i = 0; i < N; ++i) {
vector<int> ndp(i + 1);
for (int j = 0; j < i; ++j) {
ndp[j] = max(ndp[j], dp[j] - 1);
ndp[j + 1] = max(ndp[j + 1], dp[j] - 1);
}
for (pair<int, int> j : G[i]) {
ndp[j.first] = max(ndp[j.first], j.second);
}
dp = ndp;
for (int j = 0; j <= i; ++j) {
if (dp[j] >= 1) ++ans;
}
}
cout << ans << endl;
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
using namespace std;
#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define omajinai ios::sync_with_stdio(false);cin.tie(0)
#define rep(i,x) for(int i=0;i<(int)(x);++i)
#define rep1(i,x) for(int i=1;i<=(int)(x);++i)
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
template<typename T>T& max(T&a,T&b){if(a>=b)return a;return b;}
template<typename T>T& min(T&a,T&b){if(a<b)return a;return b;}
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>T get(){T a;cin>>a;return a;}
template<typename T>T rev(T a){reverse(all(a));return a;}
template<typename T>vector<T>&sort(vector<T>&a){sort(all(a));return a;}
const int inf = 1e9;
const ll linf = 3e18;
const double eps = 1e-9;
int nails[5005][5005];
signed main()
{
int N, M; cin >> N >> M;
rep(i, M) {
int A, B, X; cin >> A >> B >> X;
nails[A - 1][B - 1]++;
nails[A - 1][B]--;
nails[A + X][B - 1]--;
nails[A + X][B + X + 1]++;
nails[A + X + 1][B]++;
nails[A + X + 1][B + X + 1]--;
}
rep(i, N + 2) {
rep(j, N + 2) {
nails[i][j + 1] += nails[i][j];
}
}
rep(i, N + 2) {
rep(j, N + 2) {
nails[j + 1][i] += nails[j][i];
}
}
rep(i, N + 2) {
rep(j, N + 2) {
nails[i + 1][j + 1] += nails[i][j];
}
}
int ans = 0;
rep(i, N + 2) {
rep(j, N + 2) {
ans += nails[i][j] > 0;
}
}
cout << ans << endl;
} |
#include<cstdio>
#include<vector>
#include<cstdlib>
#include<cstring>
#include<utility>
#ifdef XS
#include<De>
#endif
using namespace std;
#define MS(m) memset(m,0,sizeof(m))
typedef unsigned U;
typedef pair<int,int > P;
typedef long long ll;
void inp();
int main(){
#ifdef XS
freopen("aoj0574.in","r",stdin);
#endif
try{
//while(1)
//int n;scanf("%d",&n);for(int i=1;i<=n;i++)
inp();
}
catch(... ){
#ifdef XS
printf("%s","exception");
#endif
}//for compatibility with cygwin c++ runtime
return 0;
}
typedef vector<int > VI;
typedef vector<VI> VII;
void pA(VII &vii){
for(U i = 0;i<vii.size();i++){
for(U j = 0;j<vii[i].size();j++){
printf("(%2d,%2d)", i,j);
}
printf("\n");
for(U j = 0;j<vii[i].size();j++){
printf("%7d",vii[i][j]);
}
printf("\n");
}
}
VII vii;
void inp(){
int n,m;scanf("%d%d",&n,&m);
const int A = n+3;
vii.resize(A);
for(U i = 0;i< vii.size();i++){
vii[i].resize(i+4, 0 );
}
for(int i = 1;i<=m;i++){
int a,b,x;scanf("%d%d%d",&a,&b,&x);
// printf("%d%d%d\n",a,b,x);
vii[a-1][b ] += -1;
vii[a-1][b+1] += 1;
vii[a+x][b ] += 1;
vii[a+x][b+x+2] += -1;
vii[a+x+1][b+1] +=-1;
vii[a+x+1][b+x+2]+=1;
}
//flow
//pA(vii);
for(int i = 0;i<A;i++){
for(U j = 1;j<vii[i].size();j++){
vii[i][j] += vii[i][j-1];
}
}
//pA(vii);
for(int j = 0;j< vii[vii.size()-1].size() ;j++){
for(int i = vii.size() - 2 ;i >= j-1&&i>=0 ;i--){
vii[i][j] += vii[i+1][j];
}
}
//pA(vii);
for(U i = 1; i < vii.size();i++){
for(U j = 1;i + j < vii.size()&&j<vii[j].size();j++){
vii[i + j -1][j] += vii[i +j-2][j-1];
}
}
int ans = 0;
for(int i = 1;i<= n;i++){
for(int j = 1;j<=i;j++){
if(vii[i][j]) ans++;
}
}
#ifdef XS
pA(vii);
#endif
printf("%d\n", ans);
}
//aoj0574.cc by xsthunder at Wed Jul 26 03:28:21 2017 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)
#define mp std::make_pair
const int INF = 1 << 24;
const int dx[8] = {0, 0, 1, -1, 1, 1, -1, -1}, dy[8] = {1, -1, 0, 0, 1, -1, 1, -1};
typedef unsigned long long ull;
typedef std::pair<int,int> P;
std::vector<int> map[5002];
int main(){
int N, M;
std::cin >> N >> M;
REP(i, N+2){
map[i].resize(i+3);
std::fill(map[i].begin(), map[i].end(), 0);
}
REP(i, M){
int a, b, x;
std::cin >> a >> b >> x;
a--; b--;
map[a][b] += +1;
map[a][b+1] += -1;
map[a+x+1][b] += -1;
map[a+x+1][b+x+2] += +1;
map[a+x+2][b+1] += +1;
map[a+x+2][b+x+2] += -1;
}
REP(i, N){
FOR(j, 1, i+1){
map[i][j] += map[i][j-1];
}
}
// puts("-----------------------------");
// REP(i, N){
// REP(j, i+1){
// printf("%2d, ", map[i][j]);
// }
// puts("");
// }
REP(i, N){
for(int j=1;i+j<N;j++){
map[i+j][j] += map[i+j-1][j-1];
}
}
// puts("-----------------------------");
// REP(i, N){
// REP(j, i+1){
// printf("%2d, ", map[i][j]);
// }
// puts("");
// }
REP(i, N){
FOR(j, i+1, N){
map[j][i] += map[j-1][i];
}
}
// puts("-----------------------------");
// REP(i, N){
// REP(j, i+1){
// printf("%2d, ", map[i][j]);
// }
// puts("");
// }
int res = 0;
REP(i, N){
REP(j, i+1){
if(map[i][j] > 0){
res++;
}
}
}
std::cout << res << std::endl;
} |
#include<iostream>
using namespace std;
int N, M;
int ruisekiwa[5050][5050];
int main() {
cin >> N >> M;
for (int i = 0; i < M; i++) {
int a, b, c;
cin >> a >> b >> c;
ruisekiwa[a][b]++;
ruisekiwa[a][b + 1]--;
ruisekiwa[a + c + 1][b]--;
ruisekiwa[a + c + 2][b + 1]++;
ruisekiwa[a + c + 1][b + c + 2]++;
ruisekiwa[a + c + 2][b + c + 2]--;
}
//???????????¢????´???????
for (int i = 0; i <= N + 10; i++) {
for (int j = 1; j <= N + 10; j++) {
ruisekiwa[i][j] += ruisekiwa[i][j - 1];
}
}
//??????????????????????´???????
for (int i = 1; i <= N + 10; i++) {
for (int j = 0; j <= N + 10; j++) {
ruisekiwa[i][j] += ruisekiwa[i - 1][j];
}
}
//??????????????????????´???????
for (int i = 1; i <= N + 10; i++) {
for (int j = 1; j <= i; j++) {
ruisekiwa[i][j] += ruisekiwa[i - 1][j - 1];
}
}
int ans = 0;
for (int i = 0; i <= N + 10; i++) {
for (int j = 0; j <= N + 10; j++) {
if (ruisekiwa[i][j] > 0)ans++;
}
}
cout << ans << endl;
return 0;
} |
// AOJ 0574
#include<cstdio>
#include<vector>
#define rep(i,a) for( int i = 0; i < (a); ++i )
#define repi(i,a,b) for( int i = (a); i < (b); ++i )
int N, M;
std::vector<std::vector<int> > map( 5002 );
int main()
{
scanf( "%d%d", &N, &M );
rep( i, N+2 )
map[i].resize( i+2 );
rep( i, M )
{
int A, B, X;
scanf( "%d%d%d", &A, &B, &X );
--A; --B;
++map[A][B]; --map[A][B+1];
--map[A+X+1][B]; ++map[A+X+1][B+X+2];
++map[A+X+2][B+1]; --map[A+X+2][B+X+2];
}
rep( i, N+2 )
repi( j, 1, i+2 )
map[i][j] += map[i][j-1];
repi( i, 1, N+2 )
rep( j, i+1 )
map[i][j] += map[i-1][j];
repi( i, 1, N+2 )
repi( j, 1, i+1 )
map[i][j] += map[i-1][j-1];
int ans = 0;
rep( i, N )
rep( j, i+1 )
ans += map[i][j]?1:0;
printf( "%d\n", ans );
return 0;
} |
#include<cstdio>
#include<algorithm>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reg(i,a,b) for(int i=(a);i<=(b);i++)
int n,m;
short int dat[5005][5005]={};
int main(void){
scanf("%d%d",&n,&m);
rep(i,m){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
dat[a][b] = max(dat[a][b],((short int)(c+1)));
}
int ans=0;
reg(p,1,n){
reg(q,1,p){
dat[p][q] = max(dat[p][q],((short int)(max(dat[p-1][q],dat[p-1][q-1])-1)));
if(dat[p][q]>0)ans++;
}
}
printf("%d\n",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
short grd[5010][5010];
short func(short a,short b){
return max(a,b);
}
int main(){
int n,m; cin>>n>>m;
for(int i=0;i<m;i++){
int a,b,x; cin>>a>>b>>x;
grd[a][b]=x+1;
}
for(int i=1;i<n;i++){
for(int j=1;j<=n;j++){
if(grd[i][j]){
grd[i+1][j]=func(grd[i+1][j],grd[i][j]-1);
if(j!=n){
grd[i+1][j+1]=func(grd[i+1][j+1],grd[i][j]-1);
}
}
}
}
int ans=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(grd[i][j]) ans++;
}
}
cout<<ans<<endl;
return 0;
} |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define dbg(x) cout<<#x"="<<x<<endl
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
#define INF 1000000000
#define N_MAX 5000
#define M_MAX 500000
int nails[N_MAX+2][N_MAX+2];
int main(){
int n,m;
cin >> n >> m;
rep(i, n+2){
rep(j,i+2)
nails[i][j]=0;
}
// imosu method (applying to triangle)
int a,b,x;
rep(i, m){
scanf("%d %d %d", &a, &b, &x);
a--; b--;
nails[a][b]++;
nails[a][b+1]--;
nails[a+x+1][b]--;
nails[a+x+2][b+1]++;
nails[a+x+2][b+x+2]--;
nails[a+x+1][b+x+2]++;
}
int current=0;
// from left to right
rep(i, n){
current=0;
rep(j, i+1){
current += nails[i][j];
nails[i][j] = current;
}
}
// from upper-right to bottom-left
rep(i,n){
current=0;
rep(j,n-i){
current += nails[i+j][i];
nails[i+j][i] = current;
}
}
int res=0;
// from upper-left to bottom-right
rep(i,n){
current=0;
rep(j, n-i){
current += nails[i+j][j];
nails[i+j][j] = current;
if(current>0) res++;
}
}
/*
rep(i, n){
rep(j,i+1){
cout << nails[i][j];
}
cout << endl;
}
*/
cout << res << endl;
} |
#include <set>
#include <cstdio>
#define REP(i,n) for(int i=0; i<(int)(n); i++)
inline int getInt(){ int s; scanf("%d", &s); return s; }
using namespace std;
int dp[5000][5000];
int memo[5000];
int main(){
int n = getInt();
int m = getInt();
REP(i,n) memo[i] = i * (i + 1) / 2;
REP(i,m){
int a = getInt() - 1;
int b = getInt() - 1;
int x = getInt();
REP(i,x + 1){
dp[b][a + i] = max(dp[b][a + i], i + 1);
}
}
int ans = 0;
REP(i,n){
int mx = 0;
REP(j,i + 1){
mx = max(mx - 1, dp[j][i]);
if(mx > 0) ans++;
}
}
printf("%d\n", ans);
return 0;
} |
#include <iostream>
#include <utility>
#include <queue>
#include <algorithm>
using namespace std;
#define MP make_pair
short dp[5010][5010]={};
int main(){
int N,M,a,b,x,res,cnt;
cin>>N>>M;
for(int i=0;i<M;i++){
cin>>a>>b>>x;
for(int j=0;j<=x;j++){
dp[a+j][b]=max(dp[a+j][b],(short)(j+1));
}
}
res=0;
for(int i=1;i<=N;i++){
cnt=0;
for(int j=1;j<=i;j++){
if(j!=1&&dp[i][j-1]==0){
cnt++;
}
dp[i][j]=max((short)(dp[i][j-1]-1),dp[i][j]);
}
if(dp[i][i]==0) cnt++;
res+=cnt;
}
cout<<N*(N+1)/2-res<<endl;
return 0;
} |
#include <cstdio>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
//#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define mp make_pair
const int INF=1001001001;
int n, m;
int s[5002][5002];
//?????????????????????http://imoz.jp/algorithms/imos_method.html
int solve()
{
int ans = 0;
rep(i,n)rep(j,i+1)s[i][j+1] += s[i][j];
rep(i,n)rep(j,i+1) s[i+1][j] += s[i][j];
rep(i,n)rep(j,i+1)s[i+1][j+1] += s[i][j];
rep(i,n)rep(j,i+1)if(s[i][j])ans++;
return ans;
}
int main()
{
scanf("%d%d", &n, &m);
int a, b, x;
for (int i = 0; i < m; i++) {
scanf("%d%d%d", &a, &b, &x);
a--; b--;
s[a][b]++;
s[a][b+1]--;
s[a+x+1][b]--;
s[a+x+2][b+1] ++;
s[a+x+1][b+x+2]++;
s[a+x+2][b+x+2]--;
}
printf("%d\n", solve());
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
return is >> p.FF >> p.SS;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
return os << p.FF << " " << p.SS;
}
template<class T>
void maxi(T& x, T y){
if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
if(x > y) x = y;
}
const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL MOD = 1e9+7;
int acc1[5010][5010];
int acc2[5010][5010];
void add(int x, int y, int d){
--acc1[x-d][y-d+1];
++acc1[x+1][y+2];
++acc2[x-d][y-d];
--acc2[x+1][y-d];
}
int get(int x, int y){
return acc1[x][y] + acc2[x][y];
}
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
int N, M;
cin >> N >> M;
REP(i,M){
int a, b, x;
cin >> a >> b >> x;
add(a+x, b+x, x);
}
REP(x,N+1) REP(y,N+1){
acc1[x][y] += (x>=1&&y>=1? acc1[x-1][y-1]: 0) + (y>=1? acc1[x][y-1]: 0) - (x>=1&&y>=2? acc1[x-1][y-2]: 0);
acc2[x][y] += (x>=1? acc2[x-1][y]: 0) + (y>=1? acc2[x][y-1]: 0) - (x>=1&&y>=1? acc2[x-1][y-1]: 0);
}
int ans = 0;
for(int x=1;x<=N;++x){
for(int y=1;y<=x;++y){
if(get(x,y) > 0)
++ans;
}
}
cout << ans << endl;
return 0;
} |
#include <stdio.h>
#include <string.h>
int plate[5678][5678];
int n, m;
int main()
{
memset(plate, 0, sizeof(plate));
scanf("%d %d", &n, &m);
for (int i = 0; i < m; ++i)
{
int a, b, x;
scanf("%d %d %d", &a, &b, &x);
--a; --b;
++plate[a][b];
--plate[a][b + 1];
--plate[a + x + 1][b];
++plate[a + x + 2][b + 1];
++plate[a + x + 1][b + x + 2];
--plate[a + x + 2][b + x + 2];
}
for (int i = 1; i <= n + 2; ++i)
{
for (int j = 1; j <= n + 2; ++j)
{
plate[i][j] += plate[i - 1][j - 1];
}
}
for (int i = 0; i <= n + 2; ++i)
{
for (int j = 1; j <= n + 2; ++j)
{
plate[i][j] += plate[i][j - 1];
}
}
for (int i = 1; i <= n + 2; ++i)
{
for (int j = 0; j <= n + 2; ++j)
{
plate[i][j] += plate[i - 1][j];
}
}
int ans = 0;
for (int i = 0; i <= n + 2; ++i)
{
for (int j = 0; j <= n + 2; ++j)
{
if (plate[i][j] > 0)++ans;
}
}
printf("%d\n",ans);
return 0;
} |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
struct Triangle {
int a, b, x;
bool operator <(const Triangle &other) const {
return a < other.a;
}
};
bool update(int &a, int v) {
if(a > v) return false;
a = v;
return true;
}
int dp[2][5000];
int main() {
int N, M;
cin >> N >> M;
vector<Triangle> triangles(M);
for(int i = 0; i < M; ++i) {
Triangle &t = triangles[i];
cin >> t.a >> t.b >> t.x;
}
sort(triangles.begin(), triangles.end());
int ans = 0;
int ptr = 0;
vector<Triangle>::iterator it = triangles.begin();
dp[ptr][0] = -1;
for(int i = 0; i < N; ++i) {
int np = 1-ptr;
while(it != triangles.end() && it->a-1 == i) {
update(dp[ptr][it->b-1], it->x);
++it;
}
for(int j = 0; j < N; ++j) {
dp[np][j] = -1;
}
for(int j = 0; j <= i; ++j) {
if(dp[ptr][j] != -1) {
++ans;
update(dp[np][j], dp[ptr][j]-1);
if(j+1 < N) update(dp[np][j+1], dp[ptr][j]-1);
}
}
ptr = np;
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
const int Mod = 1000000000 + 0;
//{{{ templates
#define TT_ template<typename T>inline
#define TTF_ template<typename T,typename F>inline
TT_ T sq(T x){return x*x;}
TT_ T In(){T x;cin>>x;return x;}
TT_ void Out(T&x){cout<<x;}
TT_ void sort(T&v){sort(begin(v),end(v));}
TT_ void revs(T&v){reverse(begin(v),end(v));}
TT_ void uniq(T&v){sort(v);v.erase(unique(begin(v),end(v)),end(v));}
TT_ int ubnd(T&v,typename T::value_type x){return upper_bound(begin(v),end(v),x)-begin(v);}
TT_ int lbnd(T&v,typename T::value_type x){return lower_bound(begin(v),end(v),x)-begin(v);}
TTF_ void inpt(T&v,int n,F f){for(v.reserve(n);n--;v.emplace_back(f()));}
TTF_ void show(T&v,F f,string d=" ",string e="\n"){int i=0;for(auto&x:v)i++&&(cout<<d),f(x);cout<<e;}
TT_ typename T::iterator minel(T&v){return min_element(begin(v),end(v));}
TT_ typename T::iterator maxel(T&v){return max_element(begin(v),end(v));}
inline void fast_io(){ios_base::sync_with_stdio(0);cin.tie(0);}
inline int in(){int x;scanf("%d",&x);return x;}
inline ll pow_mod(ll a,ll k,ll m){ll r=1;for(;k>0;a=a*a%m,k>>=1)if(k&1)r=r*a%m;return r;}
inline ll mod_inv(ll a,ll p){return pow_mod(a,p-2,p);}
//}}} priority_queue queue deque front stringstream max_element min_element insert count make_tuple
short nails[5050][5050];
int main()
{
int N, M;
N = in(), M = in();
for (int i = 0; i < M; i++){
int a, b, x;
a = in(), b = in(), x = in();
nails[a][b] = max<short>(nails[a][b], x + 1);
}
for (int i = 1; i <= N; i++){
for (int j = 1; j <= i; j++){
nails[i][j] = max<short>(nails[i][j], max(nails[i - 1][j], nails[i - 1][j - 1]) - 1);
}
}
int cnt = 0;
for (int i = 1; i <= N; i++){
for (int j = 1; j <= i; j++){
if (nails[i][j]) cnt++;
}
}
cout << cnt << endl;
return 0;
} |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
typedef pair<int,int> P;
int main() {
int N,M;
cin >> N >> M;
vector<set<P> > kugi(N+1);
for(int i=0; i<=N; ++i) {
kugi[i].insert(P(0,i+1)); // [0,i+1)
}
int ans=0;
for(int i=0; i<M; ++i) {
int A,B,X;
cin >> A >> B >> X;
for(int j=0; j<=X; ++j) {
int l=B-1, r=B+j; // [B-1,B+j) is rubber band area
set<P>::iterator itr=kugi[A+j-1].begin();
while(!kugi[A+j-1].empty() && itr!=kugi[A+j-1].end()) {
if(r <= itr->first) break;
if(itr->second <= l) {
++itr;
continue;
}
if(l<=itr->first && itr->second<=r) {
ans+=itr->second-itr->first;
itr=kugi[A+j-1].erase(itr);
if(kugi[A+j-1].empty()) {
break;
}
} else if(itr->first>=l && itr->second>r) {
int temp=itr->second;
ans+=r-itr->first;
kugi[A+j-1].erase(itr);
kugi[A+j-1].insert(P(r,temp));
break;
} else if(itr->first<l && itr->second<=r) {
int temp=itr->first;
ans+=itr->second-l;
itr=kugi[A+j-1].erase(itr);
kugi[A+j-1].insert(P(temp,l));
} else if(itr->first<l && itr->second>r) {
int templ=itr->first, tempr=itr->second;
ans+=r-l;
kugi[A+j-1].erase(itr);
kugi[A+j-1].insert(P(templ,l));
kugi[A+j-1].insert(P(r,tempr));
break;
}
}
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
using namespace std;
#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
template<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<" "; cerr<<endl; }
inline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }
typedef long long ll;
const int INF = 100000000;
const double EPS = 1e-8;
const int MOD = 1000000007;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
inline int f(int y, int x){
return 2 * y + y * (y + 1) / 2 + x;
}
int table[15000000];
int main(){
int N, M;
while(cin >> N >> M && N){
REP(i, M){
int Y, X, L;
scanf("%d %d %d", &Y, &X, &L);
Y--; X--;
table[f(Y, X)]++;
table[f(Y, X + 1)]--;
table[f(Y + L + 1, X)]--;
table[f(Y + L + 1, X + L + 2)]++;
table[f(Y + L + 2, X + 1)]++;
table[f(Y + L + 2, X + L + 2)]--;
}
for(int y = 0; y < N + 2; y++){
for(int x = 1; x <= y + 2; x++){
table[f(y, x)] += table[f(y, x - 1)];
}
}
for(int y = 1; y < N + 2; y++){
for(int x = 0; x <= y + 1; x++){
table[f(y, x)] += table[f(y - 1, x)];
}
}
for(int y = 1; y < N + 2; y++){
for(int x = 1; x <= y + 2; x++){
table[f(y, x)] += table[f(y - 1, x - 1)];
}
}
int ans = 0;
for(int y = 0; y < N; y++){
for(int x = 0; x <= y; x++){
if(table[f(y, x)] > 0) ans++;
}
}
cout << ans << endl;
}
return 0;
} |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define rep(i,j) for(int i=0;i<(j);i++)
vector<int>Nail[5005];
int N, M;
int main(){
scanf("%d%d", &N,&M);
rep(i,5005) Nail[i].resize(i+3, 0);
// cout << 0 << endl;
// rep(i,N+1){ rep(j,Nail[i].size()) cout << Nail[i][j] << " "; cout << endl; }
rep(i,M){
int A,B,X;
scanf("%d%d%d", &A, &B, &X);
Nail[A][B]++;
Nail[A][B+1]--;
Nail[A+X+1][B]--;
Nail[A+X+2][B+1]++;
Nail[A+X+1][B+X+2]++;
Nail[A+X+2][B+X+2]--;
}
// cout << 0 << endl;
// rep(i,N+3){ rep(j,Nail[i].size()) cout << Nail[i][j] << " "; cout << endl; }
rep(i,N+3) rep(j,Nail[i].size()-1) Nail[i][j+1] += Nail[i][j];
// cout << 1 << endl;
// rep(i,N+3){ rep(j,Nail[i].size()) cout << Nail[i][j] << " "; cout << endl; }
rep(i,N+3) for(int j=i;j<N+2;j++) Nail[j+1][i] += Nail[j][i];
// cout << 2 << endl;
// rep(i,N+3){ rep(j,Nail[i].size()) cout << Nail[i][j] << " "; cout << endl; }
rep(i,N+1) rep(j,Nail[i].size()-1) Nail[i+1][j+1] += Nail[i][j];
// cout << 3 << endl;
// rep(i,N+3){ rep(j,Nail[i].size()) cout << Nail[i][j] << " "; cout << endl; }
int res = 0;
rep(i,N+3) rep(j,Nail[i].size()) if(Nail[i][j]>0) res++;
printf("%d\n", res);
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int sum[5005][5005];
int main() {
int n, m; scanf("%d%d", &n, &m);
rep(i, m) {
int a, b, x; scanf("%d%d%d", &a, &b, &x);
sum[a][b]++; sum[a][b + 1]--;
sum[a + x + 1][b]--; sum[a + x + 2][b + 1]++;
sum[a + x + 1][b + x + 2]++; sum[a + x + 2][b + x + 2]--;
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= i + 1; j++)sum[i][j] += sum[i][j - 1];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= i + 1; j++)sum[i][j] += sum[i - 1][j];
int cnt = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= i + 1; j++) {
sum[i][j] += sum[i - 1][j - 1]; cnt += (sum[i][j] > 0);
}
printf("%d\n", cnt);
} |
//Name: Nails
//Level: 3
//Category: DP,動的計画法
//Note:
/*
* ある釘から何段下までが囲まれるかを持ってDP．
* 三角形の形より，ひとつの釘からは必ず左下と右下に領域が広がる．
*/
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
struct Triangle {
int a, b, x;
bool operator <(const Triangle &other) const {
return a < other.a;
}
};
bool update(int &a, int v) {
if(a > v) return false;
a = v;
return true;
}
int dp[2][5000];
int main() {
int N, M;
cin >> N >> M;
vector<Triangle> triangles(M);
for(int i = 0; i < M; ++i) {
Triangle &t = triangles[i];
cin >> t.a >> t.b >> t.x;
}
sort(triangles.begin(), triangles.end());
int ans = 0;
int ptr = 0;
vector<Triangle>::iterator it = triangles.begin();
dp[ptr][0] = -1;
for(int i = 0; i < N; ++i) {
int np = 1-ptr;
while(it != triangles.end() && it->a-1 == i) {
update(dp[ptr][it->b-1], it->x);
++it;
}
for(int j = 0; j < N; ++j) {
dp[np][j] = -1;
}
for(int j = 0; j <= i; ++j) {
if(dp[ptr][j] != -1) {
++ans;
update(dp[np][j], dp[ptr][j]-1);
if(j+1 < N) update(dp[np][j+1], dp[ptr][j]-1);
}
}
ptr = np;
}
cout << ans << endl;
return 0;
} |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<functional>
#include<string.h>
#include<vector>
using namespace std;
int a[5001][5001], b[5001][5001];
int c[5001][5001];
signed main() {
int n, m; cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y, z; cin >> x >> y >> z; x--; y--;
a[x][y]++;
a[x+z+1][y]--;
b[x][y + 1]--;
b[x+z+1][y + z + 2]++;
}
for (int i = 1; i < n; i++) {
for (int j = 0; j <= n; j++) {
a[i][j] += a[i - 1][j];
}
}
for (int i = 1; i < n; i++) {
for (int j = 1; j <= i; j++) {
b[i][j] += b[i - 1][j - 1];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
if(j)c[i][j] = c[i][j-1] + a[i][j] + b[i][j];
else c[i][j] = a[i][j] + b[i][j];
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
if (c[i][j]) { ans++; }
}
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int sum[5005][5005];
int main() {
int n, m; scanf("%d%d", &n, &m);
rep(i, m) {
int a, b, x; scanf("%d%d%d", &a, &b, &x);
sum[a][b]++; sum[a][b + 1]--;
sum[a + x + 1][b]--; sum[a + x + 2][b + 1]++;
sum[a + x + 1][b + x + 2]++; sum[a + x + 2][b + x + 2]--;
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)sum[i][j] += sum[i][j - 1];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)sum[i][j] += sum[i - 1][j];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)sum[i][j] += sum[i - 1][j - 1];
int cnt = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)cnt += (sum[i][j] > 0);
printf("%d\n", cnt);
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,int> plli;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>=0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
const ll mod = 1e9 + 7;
const ll INF = 1<<30;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;
int n, m;
vector<vector<int>> g(5010, vector<int>(5010, 0));
void imos3_add(int a, int b, int x, vector<vector<int>>& g) {
g[a][b] += 1; g[a][b + 1] -= 1;
g[a + x + 1][b] -= 1; g[a + x + 2][b + 1] += 1;
g[a + x + 1][b + x + 2] += 1; g[a + x + 2][b + x + 2] -= 1;
return ;
}
void imos3_update(vector<vector<int>>& g) {
for (int i = 0; i < 5005; i++) for (int j = 0; j < 5005; j++) g[i][j + 1] += g[i][j];
for (int i = 0; i < 5005; i++) for (int j = 0; j < 5005; j++) g[i + 1][j] += g[i][j];
for (int i = 0; i < 5005; i++) for (int j = 0; j < 5005; j++) g[i + 1][j + 1] += g[i][j];
return ;
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
cin >> m;
rep(i, m) {
int a, b, x;
cin >> a >> b >> x;
imos3_add(a, b, x, g);
}
imos3_update(g);
int ans = 0;
rep(i, 5005)rep(j, 5005) {
if (g[i][j] > 0) ans++;
}
cout << ans << endl;
} |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int d[5005][5005];
int main() {
int n, m;
cin >> n >> m;
memset(d, 0, sizeof(d));
rep(i, m) {
int a, b, x;
cin >> a >> b >> x;
a--;
b--;
d[a][b]++;
d[a][b+1]--;
d[a+x+1][b]--;
d[a+x+2][b+1]++;
d[a+x+1][b+x+2]++;
d[a+x+2][b+x+2]--;
}
rep(i, n) {
rep(j, i+1) d[i][j+1] += d[i][j];
}
rep(i, n) {
rep(j, i+1) d[i+1][j] += d[i][j];
}
rep(i, n) {
rep(j, i+1) d[i+1][j+1] += d[i][j];
}
int ans = 0;
rep(i, n) {
rep(j, i+1) {
if(d[i][j]) ans++;
}
}
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
#define loop(i,a,b) for(int i=(a); i<int(b); i++)
#define rep(i,b) loop(i,0,b)
short dp[5010][5010] = {};
int main(){
int n, m; cin >> n >> m;
rep(i, m){
int x, y, c; cin >> x >> y >> c;
x--, y--, c++;
dp[x][y] = c;
}
loop(i, 1, n)rep(j, i + 1){
int t = -100;
if (j - 1 >= 0) t = max(t, dp[i - 1][j - 1] - 1);
if (j < i + 1) t = max(t, dp[i - 1][j] - 1);
dp[i][j] = max<short>(dp[i][j], t);
}
int ans = 0;
rep(i, n){
rep(j, i + 1){
// cout << dp[i][j] << " ";
if (dp[i][j]) ans++;
}
// cout << endl;
}
cout << ans << endl;
} |
#include <iostream>
#include <algorithm>
using namespace std;
short dp[5010][5010];
int main(){
int N,M;
cin >> N >> M;
for(int i = 0 ; i < M ; i++){
int x,y,c;
cin >> y >> x >> c;
dp[y-1][x-1] = c+1;
}
for(int i = 0 ; i < N ; i++){
for(int j = 0 ; j < N ; j++){
dp[i+1][j] = max<int>(dp[i+1][j],dp[i][j]-1);
dp[i+1][j+1] = max<int>(dp[i+1][j+1],dp[i][j]-1);
}
}
int ans = 0;
for(int i = 0 ; i < N ; i++){
for(int j = 0 ; j < N ; j++){
ans += !!dp[i][j];
}
}
cout << ans << endl;
} |
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define PW(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define MODU 1000000007
#define bitcheck(a,b) ((a >> b) & 1)
#define bitset(a,b) ( a |= (1 << b))
#define bitunset(a,b) (a &= ~(1 << b))
#define MP(a,b) make_pair((a),(b))
#define Manh(a,b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
// n?¬??????????????????????????¬¬????????°???????????????????????¨???????????????????????????
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
std::fill((T*) array, (T*) (array + N), val);
}
signed main() {
int n, m;
scanf("%d %d", &n, &m);
vector<vector<int>> dp(5002, vector<int>(5002));
REP(i, m) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
dp[a-1][b-1] = max(dp[a-1][b-1],c+1);
}
int ans = 0;
REP(i, n) {
REP(j, n) {
if (dp[i][j]) {
ans++;
dp[i + 1][j] = max(dp[i + 1][j],dp[i][j] - 1);
dp[i + 1][j + 1] = max(dp[i + 1][j+1], dp[i][j] - 1);
}
}
}
printf("%d\n", ans);
return 0;
} |
#include <iostream>
using namespace std;
int mp[5001][5001];
int main(){
int n,m,a,b,x;
cin>>n>>m;
for(int i=0;i<m;++i){
cin>>a>>b>>x;
mp[a-1][b-1]=max(mp[a-1][b-1],x+1);
}
for(int i=0;i<n;++i){
for(int j=0;j<=i;++j){
if(mp[i][j]!=0){
mp[i+1][j]=max(mp[i+1][j],mp[i][j]-1);
mp[i+1][j+1]=max(mp[i+1][j+1],mp[i][j]-1);
}
}
}
int ans=0;
for(int i=0;i<n;++i){
for(int j=0;j<=i;++j){
if(mp[i][j]!=0) ++ans;
}
}
cout<<ans<<endl;
return 0;
} |
// AOJ 0574
#include<iostream>
#include<map>
#define REP(i,x) for (int i = 0; i < (x); i++)
#define TRI(a, b) nails[1+(((a)-1)*((a)+4))/2+1+(b)]
using namespace std;
typedef pair<int,int> P;
const int NMAX = 5008;
int nails[NMAX * (NMAX + 1) / 2];
int N, M;
void put(int a, int b, int x) {
TRI(a, b)++;
TRI(a, b + 1)--;
TRI(a + x - 1, b)--;
TRI(a + x, b + 1)++;
TRI(a + x - 1, b + x)++;
TRI(a + x, b + x)--;
}
/*
void show() {
REP(a,N+1) {
REP(b,a+2) {
cout << TRI(a,b);
}
cout << endl;
}
}*/
int count() {
int sum = 0;
for(int a = 1; a <= N; a++) {
for(int b = 1; b <= a; b++) {
if (TRI(a,b) > 0) {
sum++;
}
}
}
return sum;
}
void accumulate() {
// show();
for (int a = 1; a <= N; a++)
for (int b = 1; b <= a + 1; b++)
TRI(a + 1, b) += TRI(a, b);
// show();
for (int a = 1; a <= N; a++)
for (int b = 1; b <= a + 1; b++)
TRI(a + 1, b + 1) += TRI(a, b);
// show();
for (int a = 1; a <= N; a++)
for (int b = 1; b <= a + 1; b++)
TRI(a, b + 1) += TRI(a, b);
// show();
}
int main() {
cin >> N >> M;
REP(i, M) {
int a, b, x;
cin >> a >> b >> x;
put(a, b, x + 2);
}
accumulate();
cout << count() << endl;
} |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for(int i = 0; i < signed(n); i++)
#define rrep(i, n) for(int i = signed(n) - 1; i >= 0; i--)
#define all(co) co.begin(), co.end()
//#define int long long
//using LL = long long;
//using P = pair < int, int > ;
//using PI = pair < P, int > ;
typedef pair<int, int> P;
typedef long long LL;
typedef pair<P, int> PI;
typedef pair<int, P> IP;
const int INF = 1 << 29;
const LL LINF = 1ll << 62ll;
struct edge{ int from, to, cost; };
int dr[] = { -1, 0, 1, 0 };
int dc[] = { 0, 1, 0, -1 };
template<typename T = int>
vector<vector<T>> vvector(int h, int w, T def = T()){ return move(vector<vector<T>>(h, vector<T>(w, def))); }
class range {
private: struct I{ int x; int operator*(){ return x; }bool operator!=(I& lhs){ return x < lhs.x; }void operator++(){ ++x; } }; I i, n;
public:range(int n) :i({ 0 }), n({ n }){}range(int i, int n) :i({ i }), n({ n }){}I& begin(){ return i; }I& end(){ return n; }
};
signed main()
{
int n;
while (cin >> n && n)
{
int m; cin >> m;
vector<vector<int>> triangle(n);
rep(i, n) triangle[i].resize(i + 1);
rep(i, m)
{
int a, b, x; cin >> a >> b >> x;
a--; b--;
triangle[a][b] = x + 1;
}
rep(i, n - 1) rep(j, i + 1)
{
triangle[i + 1][j] = max(triangle[i + 1][j], triangle[i][j] - 1);
triangle[i + 1][j + 1] = max(triangle[i + 1][j + 1], triangle[i][j] - 1);
}
int ans = 0;
rep(i, n)rep(j, i + 1)ans += !!triangle[i][j];
cout << ans << endl;
}
return 0;
} |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
#define MAX_N 5005
struct data{
int l,r;
bool operator < (const data &p)const{
return ( l == p.l ? r > p.r : l < p.l );
}
};
int N,M,ans;
vector<data> T[MAX_N];
void calc(vector<data> &a,vector<data> &b){
vector<data> tmp;
sort(a.begin(),a.end());
a.push_back((data){MAX_N,MAX_N-1});
for(int i=1;i<(int)a.size();i++){
if(a[i].r<=a[i-1].r)a[i]=a[i-1];
else tmp.push_back(a[i-1]);
}
for(int i=1;i<(int)a.size();i++){
if(a[i].l<=a[i-1].r+1){
a[i].l=a[i-1].l;
a[i].r=max(a[i].r,a[i-1].r);
}else ans+=(a[i-1].r-a[i-1].l+1);
}
for(int i=0;i<(int)tmp.size();i++){
tmp[i].r--;
if(tmp[i].r<tmp[i].l)continue;
b.push_back(tmp[i]);
}
}
int main(){
cin>>N>>M;
for(int i=0;i<M;i++){
int a,b,c;
cin>>a>>b>>c;
T[a+c].push_back((data){b,b+c});
}
ans=0;
for(int i=N;i>=1;i--)calc(T[i],T[i-1]);
cout<<ans<<endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <cstring>
#include <cmath>
using namespace std;
const long double eps = 1e-12;
typedef long long ll;
typedef pair<int , int> pt;
#define sz(a) ((int) a.size() )
#define LL(x) (x << 1)
#define RR(x) ((x << 1) | 1)
#define For(i , a , b) for (int i = a ; i <= b ; i++)
#define Ford(i , a , b) for (int i = a ; i >= b ; i--)
#define Rep(i , n) for (int i = 0 ; i < n ; i++)
const int maxn = 5004;
int n , m;
int cheo[maxn * 2][maxn] , doc[maxn][maxn];
int b[maxn][maxn];
int a[maxn][maxn];
void ReadData() {
cin >> n >> m;
while (m--) {
int a , b , x; cin >> a >> b >> x;
doc[b ][a]++;
doc[b ][min(n + 1 , a + x + 1 )]--;
cheo[a - b - 1 + n ][a]--;
cheo[a - b - 1 + n ][min(n + 1 , a + x + 1)]++;
}
For(j , 0 , n) {
int sum = 0;
For(i , 1 , n) {
sum += doc[j][i];
b[i][j] += sum;
}
}
For(i , 1 , n) {
For(j , 1 , n) {
cheo[i - j + n][i] += cheo[i - j + n ][i - 1];
b[i][j] += cheo[i - j + n ][i];
}
}
int res = 0;
For(i , 1 , n) {
For(j , 1 , n) {
b[i][j] += b[i][j - 1]; if (b[i][j]) res++;
}
}
cout << res << endl;
}
void Process() {
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("/users/youaremysky/documents/workspace/input.inp" , "r" , stdin);
ReadData();
Process();
} |
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int N, M;;
scanf("%d %d", &N, &M);
vector<vector<int> > memo(N + 2, vector<int>(N + 2, 0));
for(int i = 0; i < M; i++){
int a, b, x;
scanf("%d %d %d", &a, &b, &x);
a--; b--;
memo[a][b]++;
memo[a][b + 1]--;
memo[a + x + 1][b]--;
memo[a + x + 1][b + x + 2]++;
memo[a + x + 2][b + 1]++;
memo[a + x + 2][b + x + 2]--;
}
int res = 0;
for(int i = 0; i < N + 2; i++){
for(int j = 0; j < N + 2; j++){
if(j > 0) memo[i][j] += memo[i][j - 1];
}
}
for(int i = 0; i < N + 2; i++){
for(int j = 0; j < N + 2; j++){
if(i > 0) memo[i][j] += memo[i - 1][j];
}
}
for(int i = 0; i < N + 2; i++){
for(int j = 0; j < N + 2; j++){
if(i > 0 && j > 0) memo[i][j] += memo[i - 1][j - 1];
if(memo[i][j] > 0) res++;
}
}
printf("%d\n", res);
return 0;
}
|
// ------!!! I AM A PROFESSIONAL!! !!!------ //
#include <bits/stdc++.h>
using namespace std;
int N, Q, a, b, x, dp[5009][5009];
int main() {
scanf("%d%d", &N, &Q);
while(Q--) {
scanf("%d%d%d", &a, &b, &x); a--, b--, x++;
dp[a][b] = max(dp[a][b], x);
}
int ret = dp[0][0] ? 1 : 0;
for(int i = 1; i < N; i++) {
for(int j = 0; j <= i; j++) {
dp[i][j] = max(dp[i][j], dp[i - 1][j] - 1);
if(j) dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] - 1);
if(dp[i][j]) ret++;
}
}
printf("%d\n", ret);
return 0;
} |
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef double db;
#define fr first
#define sc second
#define pb push_back
#define rep(i,x) for(ll i=0;i<x;i++)
#define rep1(i,x) for(ll i=1;i<=x;i++)
#define rrep(i,x) for(ll i=x-1;i>=0;i--)
#define rrep1(i,x) for(ll i=x;i>0;i--)
ll N,M;
ll a,b,x;
ll imos[5002][5002];
int main()
{
scanf("%lld%lld",&N,&M);
ll H=N;
ll W=N;
rep(i,M){
scanf("%lld%lld%lld",&a,&b,&x);
a--;
--b;
x++;
imos[a][b]++;
imos[a][b+1]--;
imos[a+x][b]--;
imos[a+x+1][b+1]++;
imos[a+x][b+x+1]++;
imos[a+x+1][b+x+1]--;
}
rep(i,H+2) rep(j,W+2){
if(i>0&&j>0){
imos[i][j]+=imos[i-1][j-1];
}
}
rep(i,H+2) rep(j,W+2){
if(i>0){
imos[i][j]+=imos[i-1][j];
}
}
rep(i,H+2) rep(j,W+2){
if(j>0){
imos[i][j]+=imos[i][j-1];
}
}
ll ans=0;
rep(i,H) rep(j,i+1) if(imos[i][j]>0) ans++;
cout<<ans<<endl;
} |
// AOJ 0574 (http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0574)
#include<cstdio>
#include<vector>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
const int MAX_N = 5000;
int N, M;
std::vector<std::vector<int> > S( MAX_N+2 );
int main()
{
scanf( "%d%d", &N, &M );
rep( i, N+2 )
S[i].resize( i+2 );
rep( i, M )
{
int A, B, X;
scanf( "%d%d%d", &A, &B, &X );
--A; --B;
++S[A][B]; --S[A][B+1];
--S[A+X+1][B]; ++S[A+X+1][B+X+2];
++S[A+X+2][B+1]; --S[A+X+2][B+X+2];
}
rep( i, N+2 ) rep( j, i+1 )
S[i][j+1] += S[i][j];
rep( i, N+1 ) rep( j, i+2 )
S[i+1][j] += S[i][j];
rep( i, N+1 ) rep( j, i+1 )
S[i+1][j+1] += S[i][j];
int ans = 0;
rep( i, N ) rep( j, i+1 ) if( S[i][j] )
++ans;
printf( "%d\n", ans );
return 0;
} |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int index(int y, int x) {
return y * (y + 1) / 2 + x;
}
int main() {
int N, M;
cin >> N >> M;
vector<int> nail(index(N, N));
for(int i = 0; i < M; ++i) {
int A, B, X;
cin >> A >> B >> X;
--A; --B;
nail[index(A, B)] = max(nail[index(A, B)], X + 1);
}
int answer = 0;
for(int i = 0; i < N; ++i) for(int j = 0; j <= i; ++j) {
if(0 <= j - 1) nail[index(i, j)] = max(nail[index(i, j)], nail[index(i - 1, j - 1)] - 1);
if(j < i) nail[index(i, j)] = max(nail[index(i, j)], nail[index(i - 1, j)] - 1);
if(nail[index(i, j)]) ++answer;
}
cout << answer << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// マクロ
// forループ
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=(a);i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(ll)(b);i--)
// xにはvectorなどのコンテナ
#define ALL(x) (x)begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
// 出力
#define PRINT(x) cout<<(x)<<endl
#define PRINTA(x,n) REP(i,n)PRINT(x[i])
// 定数
#define INF 1000000000000 // 10^12
#define MOD 1000000007 // 10^9+7
// 略記
#define PB push_back
#define MP make_pair
int N, M, A[500100], B[500100], X[500100];
int imos[5009][5009];
int main() {
// 入力
cin >> N >> M;
REP(i, M) cin >> A[i] >> B[i] >> X[i];
// imos を初期化する
REP(i, 5009) {
REP(j, 5009) {
imos[i][j] = 0;
}
}
// 左 -> 右, 右上 -> 左下, 右下 -> 左上
REP(i, M) {
imos[A[i] - 1][B[i] - 1]--;
imos[A[i] - 1][B[i] ]++;
imos[A[i] + X[i] ][B[i] + X[i] + 1]--;
imos[A[i] + X[i] + 1][B[i] + X[i] + 1]++;
imos[A[i] + X[i] + 1][B[i] ]--;
imos[A[i] + X[i] ][B[i] - 1]++;
}
// 左 -> 右
FOR(i, 0, N+1) {
FOR(j, 1, i+1) {
imos[i][j] += imos[i][j-1];
}
}
// 右上 -> 左下
FOR(i, 1, N+1) {
FOR(j, 0, i+1) {
imos[i][j] += imos[i-1][j];
}
}
// 右下 -> 左上
FORD(i, N, 0) {
FORD(j, i, 0) {
imos[i][j] += imos[i+1][j+1];
}
}
int ans = 0;
FOR(i, 1, N) {
FOR(j, 1, i) {
if (imos[i][j] > 0) ans++;
// printf("%d ", imos[i][j]);
}
// printf("\n");
}
cout << ans << endl;
return 0;
}
|
#include <cstdio>
int zari(int i,int j){
return (i*(i+1)/2+j);
}
int n,m;
int maps[5000*2505]={0};
int main(void){
//釘(i,j)をmaps[i*(i+1)/2+j]とする。
scanf("%d%d",&n,&m);
int i,j;
int a,b,c;
for(i=0;i<m;i++){
scanf("%d%d%d",&a,&b,&c);
a+=1;//b--;
maps[zari(a,b)]+=1;
maps[zari(a,b+1)]+=-1;
maps[zari(a+c+1,b)]+=-1;
maps[zari(a+c+2,b+1)]+=1;
maps[zari(a+c+1,b+c+2)]+=1;
maps[zari(a+c+2,b+c+2)]+=-1;
}
for(i=1;i<=n+3;i++){
for(j=1;j<=i;j++){
maps[zari(i,j)]+=maps[zari(i,j-1)];
}
}
for(j=0;j<=n+3;j++){
for(i=j;i<=n+3;i++){
maps[zari(i,j)]+=maps[zari(i-1,j)];
}
}
int ans=0;
for(i=1;i<=n+3;i++){
//for(j=0;j<i*2;i++)printf("\x0020");
for(j=1;j<=i;j++){
maps[zari(i,j)]+=maps[zari(i-1,j-1)];
if(maps[zari(i,j)]!=0)ans++;
//printf("%d\x0020",maps[zari(i,j)]);
}
//printf("\n");
}
printf("%d\n",ans);
return 0;
} |
#include<iostream>
using namespace std;
short max(short x,short y){if(x<y)return y; return x;}
int main(){
static short imos[5005][5005]={0};
int n,m,a,b,x;
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++){
scanf("%d%d%d",&a,&b,&x);
imos[a][b]=max(imos[a][b],x+1);
}
int ans=0;
for(int i=1;i<=n;i++)for(int j=1;j<=i;j++){
imos[i][j]=max(imos[i][j],max(imos[i-1][j]-1,imos[i-1][j-1]-1));
if(imos[i][j]>0)ans++;
}
printf("%d\n",ans);
} |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
using namespace std;
#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define omajinai ios::sync_with_stdio(false);cin.tie(0)
#define rep(i,x) for(int i=0;i<(int)(x);++i)
#define rep1(i,x) for(int i=1;i<=(int)(x);++i)
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
template<typename T>T& max(T&a,T&b){if(a>=b)return a;return b;}
template<typename T>T& min(T&a,T&b){if(a<b)return a;return b;}
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>T get(){T a;cin>>a;return a;}
template<typename T>T rev(T a){reverse(all(a));return a;}
template<typename T>vector<T>&sort(vector<T>&a){sort(all(a));return a;}
const int inf = 1e9;
const ll linf = 3e18;
const double eps = 1e-9;
int nails[5005][5005];
signed main()
{
int N, M; cin >> N >> M;
rep(i, M) {
int A, B, X; cin >> A >> B >> X;
nails[A - 1][B - 1]++;
nails[A - 1][B]--;
nails[A + X][B - 1]--;
nails[A + X][B + X + 1]++;
nails[A + X + 1][B]++;
nails[A + X + 1][B + X + 1]--;
}
rep(i, N + 2) {
rep(j, N + 2) {
nails[i][j + 1] += nails[i][j];
}
}
rep(i, N + 2) {
rep(j, N + 2) {
nails[j + 1][i] += nails[j][i];
}
}
rep(i, N + 2) {
int y = i + 1;
int x = 1;
while (y <= N && x <= N) {
nails[y][x] += nails[y - 1][x - 1];
y++;
x++;
}
}
int ans = 0;
rep(i, N + 2) {
rep(j, N + 2) {
ans += nails[i][j] > 0;
}
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long int64;
short flag[5005][5005];
int main(){
int N, M;
scanf("%d %d", &N, &M);
for(int i = 0; i < M; i++){
int A, B, C;
scanf("%d %d %d", &A, &B, &C);
flag[A][B] = max< short >( flag[A][B], C + 1);
}
int ret = 0;
for(int i = 1; i <= N; i++){
for(int j = 1; j <= i; j++){
flag[i][j] = max< short >( flag[i][j], max( flag[i - 1][j - 1], flag[i - 1][j]) - 1);
if(flag[i][j] > 0) ret++;
}
}
cout << ret << endl;
} |
#include<iostream>
#include<algorithm>
using namespace std;
short max(int a,int b){
return a>b?a:b;
}
short nails[5001][5001];
int main(void){
int n,m,a,b,x;
cin >> n >> m;
for(int i=0;i<m;i++){
cin >> a >> b >> x;
nails[a][b]=x+1;
}
for(int i=1;i<=n;i++)
for(int j=1;j<=i;j++)
nails[i][j]=max(nails[i][j],max(nails[i-1][j-1],nails[i-1][j])-1);
int cnt=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=i;j++)
if(nails[i][j]>0)cnt++;
cout << cnt << endl;
return 0;
} |
#include<cstdio>
#include<cstring>
#include<vector>
#include<map>
#include<functional>
#include<algorithm>
using namespace std;
int n, m;
int nails[2][5009];
int ans;
map<pair<int, int> , int> tops;
vector<pair<int, int> > toppoints;
int main(){
scanf("%d%d", &n, &m);
for(int i = 0;i < m;i++){
int a, b, x;
scanf("%d%d%d", &a, &b, &x);
a--;b--;
toppoints.push_back(make_pair(a, b));
if(tops.find(make_pair(a, b)) == tops.end())tops[make_pair(a, b)] = 0;
tops[make_pair(a, b)] = max(x + 1, tops[make_pair(a, b)]);
}
sort(toppoints.begin(), toppoints.end(), greater<pair<int, int> >());
memset(nails, 0, sizeof(nails));
for(int i = 0;i <= n;i++){
memset(nails[(i + 1) % 2], 0, sizeof(int) * 5009);
for(int j = 0;j <= n;j++){
if(!toppoints.empty() && toppoints.back() == make_pair(i, j)){
nails[i % 2][j] = max(tops[make_pair(i, j)], nails[i % 2][j]);
while(!toppoints.empty() && toppoints.back() == make_pair(i, j)){
toppoints.pop_back();
}
}
if(nails[i % 2][j] != 0)ans++;
nails[(i + 1) % 2][j] = max(nails[(i + 1) % 2][j], nails[i % 2][j] - 1);
nails[(i + 1) % 2][j + 1] = max(nails[(i + 1) % 2][j + 1], nails[i % 2][j] - 1);
}
}
printf("%d\n", ans);
return 0;
} |
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
#define MAX_N 5005
struct data{
int l,r;
bool operator < (const data &p)const{
return ( l == p.l ? r > p.r : l < p.l );
}
};
int N,M,ans;
vector<data> T[MAX_N];
void calc(vector<data> &a,vector<data> &b){
vector<data> tmp;
sort(a.begin(),a.end());
a.push_back((data){MAX_N,MAX_N-1});
for(int i=1;i<(int)a.size();i++){
if(a[i].r<=a[i-1].r)a[i]=a[i-1];
else tmp.push_back(a[i-1]);
}
for(int i=1;i<(int)a.size();i++){
if(a[i].l<=a[i-1].r+1){
a[i].l=a[i-1].l;
a[i].r=max(a[i].r,a[i-1].r);
}else ans+=(a[i-1].r-a[i-1].l+1);
}
for(int i=0;i<(int)tmp.size();i++){
tmp[i].r--;
if(tmp[i].r<tmp[i].l)continue;
b.push_back(tmp[i]);
}
}
int main(){
int a,b,c;
scanf("%d%d",&N,&M);
for(int i=0;i<M;i++){
scanf("%d%d%d",&a,&b,&c);
T[a+c].push_back((data){b,b+c});
}
ans=0;
for(int i=N;i>=1;i--)calc(T[i],T[i-1]);
printf("%d\n",ans);
return 0;
} |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> ban(n + 2, vector<int>(n + 2));
for (int i = 0; i < m; i++) {
int a, b, x;
cin >> a >> b >> x;
a--;
b--;
ban[a][b]++;
ban[a][b + 1]--;
ban[a + x + 1][b]--;
ban[a + x + 2][b + 1]++;
ban[a + x + 1][b + x + 2]++;
ban[a + x + 2][b + x + 2]--;
}
for (int i = 1; i < n + 2; i++) {
for (int j = 0; j < n + 2; j++) {
ban[i][j] += ban[i - 1][j];
}
}
for (int i = 0; i < n + 2; i++) {
for (int j = 1; j < n + 2; j++) {
ban[i][j] += ban[i][j - 1];
}
}
for (int i = 1; i < n + 2; i++) {
for (int j = 1; j < n + 2; j++) {
ban[i][j] += ban[i - 1][j - 1];
}
}
int ret = 0;
for (int i = 0; i < n + 2; i++) {
for (int j = 0; j < n + 2; j++) {
if (ban[i][j] > 0)ret++;
}
}
cout << ret << endl;
return 0;
}
|
//39
#include<iostream>
#include<algorithm>
#include<cstdlib>
using namespace std;
short gg[5001][5001];
int main(){
int n,m;
cin>>n>>m;
short (*g)[5001]=gg;//(short(*)[5001])malloc(sizeof(short)*5001*5001);
fill(g[0],g[5000],-1);
while(m--){
int a,b,x;
cin>>a>>b>>x;
g[a-1][b-1]=x;
}
int a=0;
for(int i=0;i<n;i++){
for(int j=0;j<=i;j++){
a+=g[i][j]>=0;
g[i+1][j]=max<short>(g[i+1][j],g[i][j]-1);
g[i+1][j+1]=max<short>(g[i+1][j+1],g[i][j]-1);
}
}
cout<<a<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define mp make_pair
#define space << " " <<
#define END << endl
#define pb push_back
#define fo(i,n) for(int i = 0; i<n; ++i)
#define ff(i,n) for(int i = 1; i<n; ++i)
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<int,pii> pi;
typedef long long ll;
typedef pair<int,ll> pil;
typedef pair<ll,int> pli;
typedef pair<ll,ll> pll;
typedef pair<ll,pll> pl;
typedef vector<pil>vil;
const int M = 5 * 1e5 + 100;
const int N = 5 * 1e3 + 100;
pair<pii,int> a[M];
int board[N][N];
int n,k;
int work()
{
int now = 0;
int high = 0;
int ans = 0;
for(int i=1; i<=n; ++i) for(int j=1; j<=i; ++j)
{
while(now < k && a[now].st.st == i && a[now].st.nd == j) { high = max(high ,a[now].nd + 1); now++; }
//cout << i space j space high << endl;
board[i - high + 1][j] += 1;
board[i + 1][j] += -1;
high = max(high-1,0);
}
//cout << 1 << endl;
for(int i=1; i<=n; ++i) for(int j=1; j<=i; ++j)
{
board[i][j] += board[i-1][j];
}
for(int i=1; i<=n; ++i) for(int j=1; j<=i; ++j) if(board[i][j]) ans++;
//for(int i=1; i<=n; ++i) { for(int j=1; j<=i; ++j) cout << board[i][j] << " "; cout << endl; }
return ans;
}
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n >> k;
fo(i,k) { cin >> a[i].st.st >> a[i].st.nd >> a[i].nd; a[i].st.st += a[i].nd; }
//for(int i=0; i<k; ++i) cout << a[i].st.st space a[i].st.nd space a[i].nd << endl;
//cout << 1 << endl;
sort(a,a+k);
cout << work() << endl;
} |
#include<iostream>
#include<vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
vector<int> nails[5010];
int main() {
rep (i, 5010) rep (j, i + 10) nails[i].push_back(0);
int n, m;
cin >> n >> m;
rep (i, m) {
int a, b, x;
cin >> a >> b >> x;
--a;
--b;
++nails[a][b];
--nails[a][b + 1];
--nails[a + x + 1][b];
++nails[a + x + 2][b + 1];
++nails[a + x + 1][b + x + 2];
--nails[a + x + 2][b + x + 2];
}
rep (i, n + 3) rep (j, i + 3) {
nails[i][j + 1] += nails[i][j];
}
rep (i, n + 3) rep (j, i + 3) {
nails[i + 1][j] += nails[i][j];
}
rep (i, n + 3) rep (j, i + 3) {
nails[i + 1][j + 1] += nails[i][j];
}
int res = 0;
rep (i, n + 3) rep (j, i + 3) {
if (nails[i][j] > 0) ++res;
}
cout << res << endl;
return 0;
} |
//Bokan ga bokka--nn!!
//Daily Lunch Special Tanoshii !!
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
typedef long long ll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 2000000000
#define f first
#define s second
#define rep(i,x) for(int i=0;i<x;i++)
short dp[5005][5005]={};
int main()
{
srand((unsigned int)time(NULL));
int n,q; scanf("%d %d",&n,&q);
for(int i=0;i<q;i++)
{
int x,y,v; scanf("%d%d%d",&x,&y,&v);
dp[x][y]=max(dp[x][y],(short)++v);
}
int ret=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
{
if(!dp[i][j]) continue;
ret++;
dp[i+1][j]=max(dp[i+1][j],--dp[i][j]);
dp[i+1][j+1]=max(dp[i+1][j+1],dp[i][j]);
}
}
printf("%d\n",ret);
} |
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int n,m;
const int Max = 5020;
int data[Max * Max * 5 / 3];
int* getdata(int x,int y){
//return &data[y * Max + x];
int a;
y += 2;
a = (y * (y + 1)) / 2;
a += x;
return &data[a];
}
void debug(){
#if 0
//int n = 50;
for(int j=1;j<=n + 1;j++){
for(int i=1;i<=j + 2;i++){
printf("%+d ",*(getdata(i,j)));
}
puts("");
}
puts("");
#endif
}
int main(){
scanf("%d %d",&n,&m);
int a,b,x;
for(int i=0;i<m;i++){
scanf("%d %d %d",&b,&a,&x);
//printf("%d %d %d\n",a,b,x);
*(getdata(a,b)) += 1;
*(getdata(a+1,b)) -= 1;
*(getdata(a,b + x + 1)) -= 1;
*(getdata(a+1,b + x + 1 + 1)) += 1;
*(getdata(a + x + 2,b + x + 1)) += 1;
*(getdata(a + x + 2,b + x + 1 + 1)) -= 1;
}
debug();
//ツ可。ツづ可づづゥ
for(int i=0;i<Max;i++){
int s = 0;
for(int j=0;j<i + 2;j++){
s += *(getdata(j,i));
*(getdata(j,i)) = s;
}
}
debug();
//ツ縦ツづ可づづゥ
for(int i=0;i<Max;i++){
int s = 0;
for(int j=i;j<Max;j++){
s += *(getdata(i,j));
*(getdata(i,j)) = s;
}
}
debug();
//ツ偲篠づ淞づ可偲ヲツづゥ
for(int i=0;i<Max;i++){
int s=0;
for(int j=0;i+j<Max;j++){
//printf("%d,%d:%d\n",i,j,i+j);
if(j < 0 || j + i < 0){ continue; }
if(j >= Max || j + i >= Max){ break; }
s += *(getdata(j,i+j));
*(getdata(j,i+j)) = s;
}
}
debug();
int ans = 0;
for(int i=0;i<Max;i++){
for(int j=0;j<=i;j++){
if(*(getdata(j,i)) > 0){
ans++;
}
}
}
printf("%d\n",ans);
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
vector<int> kugi[N+2];
kugi[0].push_back(0);
kugi[0].push_back(0);
for(int i=1; i<=N+1; ++i) {
kugi[i].resize(i+1,0);
}
for(int i=0; i<M; ++i) {
int A,B,X;
cin >> A >> B >> X;
kugi[A][B]=max(X+1,kugi[A][B]);
}
int ans=0;
for(int i=1; i<=N; ++i) {
for(int j=1; j<=i; ++j) {
if(kugi[i][j]>0) ++ans;
kugi[i+1][j]=max(kugi[i+1][j],kugi[i][j]-1);
kugi[i+1][j+1]=max(kugi[i+1][j+1],kugi[i][j]-1);
}
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<fstream>
#include<sstream>
#include<vector>
#include<algorithm>
#include<string>
#include<cstring>
#include<cmath>
#include<iomanip>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<list>
#include<utility>
#include<climits>
#define INF INT_MAX/2
#define EPS 1.0e-7
#define MAX_N 5005
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
int N,M;
vector<int> cnt[MAX_N];
int main(){
cin.sync_with_stdio(false);
cin >> N >> M;
for(int i=0;i<N+2;++i)
cnt[i].resize(i+3);
for(int i=0;i<M;++i){
int x,y,l;
cin >> x >> y >> l;
--x;
--y;
++l;
cnt[x][y] += 1;
cnt[x+l+1][y+1] += 1;
cnt[x+l][y+l+1] += 1;
cnt[x][y+1] -= 1;
cnt[x+l][y] -= 1;
cnt[x+l+1][y+l+1] -= 1;
}
for(int i=0;i<N;++i)
for(int j=1;j<=i;++j)
cnt[i][j] += cnt[i][j-1];
for(int i=0;i<N;++i)
for(int j=1;i+j<N;++j)
cnt[i+j][i] += cnt[i+j-1][i];
for(int i=0;i<N;++i)
for(int j=1;i+j<N;++j)
cnt[i+j][j] += cnt[i+j-1][j-1];
int ans = 0;
for(int i=0;i<N;++i)
for(int j=0;j<=i;++j)
if(cnt[i][j])
++ans;
cout << ans << endl;
return 0;
} |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
int N, M;
vector<vector<int> >g(5002);
int main(){
rep(i,5002){
g[i].resize(i+2);
fill(g[i].begin(), g[i].end(), 0);
}
// memset(g, 0, sizeof(g));
scanf("%d%d", &N, &M);
int A, B, X;
rep(i, M){
scanf("%d%d%d",&A,&B,&X); A--; B--; X++;
g[A][B] += 1;
g[A][B+1] += -1;
g[A+X][B] += -1;
g[A+X+1][B+1] += 1;
g[A+X][B+X+1] += 1;
g[A+X+1][B+X+1] += -1;
}
rep(i, 5001) rep(j,i+1) g[i][j+1] += g[i][j];
rep(j, 5001) REP(i,j,5000) g[i+1][j] += g[i][j];
rep(i, 5001) rep(j,i+1) g[i+1][j+1] += g[i][j];
int res = 0;
rep(i, 5001) rep(j, i+1) res += (g[i][j]>=1);
printf("%d\n", res);
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.